A graph theoretic approach to automata minimality
- Authors: Restivo, A; Vaglica, R
- Publication year: 2012
- Type: Articolo in rivista (Articolo in rivista)
- OA Link: http://hdl.handle.net/10447/73706
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.