Other formats:
BibTeX
LaTeX
RIS
@inproceedings{592464, author = {Polák, Libor}, address = {Milano}, booktitle = {Proc. Descriptional Complexity of Formal Systems 7th Workshop}, keywords = {multiple entry DFA; minimalization; conversion; decomposition}, language = {eng}, location = {Milano}, pages = {261-268}, publisher = {Universita degli Studi di Milano, Departimento Di Informatica e Comunicazione}, title = {Remarks on multiple entry deterministic finite automata}, year = {2005} }
TY - JOUR ID - 592464 AU - Polák, Libor PY - 2005 TI - Remarks on multiple entry deterministic finite automata PB - Universita degli Studi di Milano, Departimento Di Informatica e Comunicazione CY - Milano KW - multiple entry DFA KW - minimalization KW - conversion KW - decomposition N2 - 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. ER -
POLÁK, Libor. Remarks on multiple entry deterministic finite automata. In \textit{Proc. Descriptional Complexity of Formal Systems 7th Workshop}. Milano: Universita degli Studi di Milano, Departimento Di Informatica e Comunicazione, 2005, p.~261-268.
|