The paper presents a graph-theoretic approach to test the minimality of a deterministic automaton. In particular, we focus on problems concerning the dependence of the minimality of an automaton on the choice of the set F of final states or on the cardinality of the set F . We introduce different minimality conditions of an automaton and show that such conditions can be characterized in graph-theoretic terms.
|Number of pages||10|
|Journal||Theoretical Computer Science|
|Publication status||Published - 2012|
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- General Computer Science