Abstract
| Lingua originale | English |
|---|---|
| pagine (da-a) | 282-291 |
| Numero di pagine | 10 |
| Rivista | Theoretical Computer Science |
| Volume | 429 |
| Stato di pubblicazione | Published - 2012 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Cita questo
A graph theoretic approach to automata minimality. / Restivo, Antonio; Vaglica, Roberto.
In: Theoretical Computer Science, Vol. 429, 2012, pag. 282-291.Risultato della ricerca: Article
}
TY - JOUR
T1 - A graph theoretic approach to automata minimality
AU - Restivo, Antonio
AU - Vaglica, Roberto
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
UR - http://hdl.handle.net/10447/73706
M3 - Article
VL - 429
SP - 282
EP - 291
JO - Theoretical Computer Science
JF - Theoretical Computer Science
SN - 0304-3975
ER -