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.
| Lingua originale | English |
|---|---|
| pagine (da-a) | 282-291 |
| Numero di pagine | 10 |
| Rivista | Theoretical Computer Science |
| Volume | 429 |
| Stato di pubblicazione | Published - 2012 |
All Science Journal Classification (ASJC) codes
- ???subjectarea.asjc.2600.2614???
- ???subjectarea.asjc.1700.1700???