Finite automata change not deterministic to deterministic finite automaton

Asked

Viewed 36 times

0

What happens exactly when the transformation algorithm of a Nondeterministic Finite Automaton (NFA) into Deterministic Finite Automaton (DFA) is applied to an automaton that is already deterministic?

language-independent
No answers

Browser other questions tagged language-independent

You are not signed in. Login or sign up in order to post.