38 search results - page 4 / 8 » Minimizing Deterministic Lattice Automata |
CG
2010
Springer
13 years 8 months ago
2010
Springer
Cyclic cellular automata on the integer planar lattice are known to typically evolve through distinct phases ending with minimal periodic terminal states that usually appear as in...
CAI
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
WIA
2009
Springer
14 years 1 months ago
2009
Springer
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
IPL
2008
13 years 8 months ago
2008
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...
WIA
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...