38 search results - page 2 / 8 » Minimizing Deterministic Lattice Automata |
WIA
2007
Springer
14 years 3 months ago
2007
Springer
IJFCS
2008
13 years 9 months ago
2008
STACS
2009
Springer
14 years 4 months 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...
WIA
1998
Springer
14 years 2 months ago
1998
Springer
A cover-automaton A of a finite language L is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic co...
AMW
2010
13 years 11 months ago
2010
We provide a Myhill-Nerode-like theorem that characterizes the class of data languages recognized by deterministic finite-memory automata (DMA). As a byproduct of this characteriza...