Remarks on multiple entry deterministic finite automata

Authors:
Libor Polák
Affiliations:
Department of Mathematics, Masaryk University, Brno, Czech Republic
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2007

Citing 4
Cited 0

On the state complexity of k-entry deterministic finite automata

Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Star Height of Reversible Languages and Universal Automata

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Residual Finite State Automata

Fundamenta Informaticae
Minimizing finite automata is computationally hard

DLT'03 Proceedings of the 7th international conference on Developments in language theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate several aspects of the multiple entry DFA's. We consider their DFA conversion. Further, we show that they appear as minimal NFA's for certain classes of languages. Finally, we deal with their decompositions into disjoint unions of automata with fewer states.