Remarks on multiple entry deterministic finite automata

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Science. Official publication website can be found on muni.cz.

Authors	POLÁK Libor
Year of publication	2005
Type	Article in Proceedings
Conference	Proc. Descriptional Complexity of Formal Systems 7th Workshop
MU Faculty or unit	Faculty of Science
Citation
Field	General mathematics
Keywords	multiple entry DFA; minimalization; conversion; decomposition
Description	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 less number of states.
Related projects:	Institute for Theoretical Computer Science