| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437235 | Theoretical Computer Science | 2012 | 10 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
