February 2022
Beginner to intermediate
572 pages
13h
English
Any dfa defines a unique language, but the converse is not true. For a given language, there are many dfa’s that accept it. There may be a considerable difference in the number of states of such equivalent automata. In terms of the questions we have considered so far, all solutions are equally satisfactory, but if the results are to be applied in a practical setting, there may be reasons for preferring one over another.
Read now
Unlock full access