116 search results - page 1 / 24 » Minimization of Automata |
MFCS
2007
Springer
13 years 11 months ago
2007
Springer
The minimization problem for visibly pushdown automata (VPA) is studied. Two subclasses of VPA are introduced: call driven automata, and block automata. For the first class, minim...
WIA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We explore expression automata with respect to determinism, minimization and primeness. We define determinism of expression automata using prefix-freeness. This approac...
JCSS
2007
13 years 5 months ago
2007
Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. First, we study unrank...
LATA
2010
Springer
13 years 10 months ago
2010
Springer
STACS
2009
Springer
14 years 4 days ago
2009
Springer
Abstract. We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moo...