Minimization algorithms for sequential transducers
Theoretical Computer Science
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Finite-state transducers in language and speech processing
Computational Linguistics
On the State Minimization of Nondeterministic Finite Automata
IEEE Transactions on Computers
Learning with Weighted Transducers
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Circular sturmian words and Hopcroft's algorithm
Theoretical Computer Science
Finite automata and their decision problems
IBM Journal of Research and Development
On extremal cases of Hopcroft's algorithm
Theoretical Computer Science
Optimal simulation of self-verifying automata by deterministic automata
Information and Computation
A challenging family of automata for classical minimization algorithms
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Inference improvement by enlarging the training set while learning DFAs
CIARP'05 Proceedings of the 10th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis and Applications
Experimental evaluation of classical automata constructions
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Brzozowski's algorithm (co)algebraically
Logic and Program Semantics
Algebra-coalgebra duality in brzozowski's minimization algorithm
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Moore automata represent a model that has many applications. In this paper we define a notion of coherent nondeterministic Moore automaton (NMA) and show that such a model has the same computational power of the classical deterministic Moore automaton. We consider also the problem of constructing the minimal deterministic Moore automaton equivalent to a given NMA. In this paper we propose an algorithm that is a variant of Brzozowski's algorithm in the sense that it is essentially structured as reverse operation and subset construction performed twice.