POLÁK, Libor. Remarks on multiple entry deterministic finite automata. Journal of Automata, Languages and Combinatorics, Magdeburg (Germany), 2007, vol. 12, 1/2, p. 279-288. ISSN 1430-189X.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Remarks on multiple entry deterministic finite automata
Name in Czech Poznámky o deterministických konečných automatech s více vstupy
Authors POLÁK, Libor.
Edition Journal of Automata, Languages and Combinatorics, Magdeburg (Germany), 2007, 1430-189X.
Other information
Original language English
Type of outcome article in a journal
Field of Study 10000 1. Natural Sciences
Country of publisher Germany
Confidentiality degree is not subject to a state or trade secret
Organization unit Faculty of Science
Keywords in English multiple entry DFA; minimalization; conversion; decomposition
Tags conversion, decomposition, minimalization, multiple entry DFA
Tags International impact, Reviewed
Changed by Changed by: doc. RNDr. Libor Polák, CSc., učo 107. Changed: 17/7/2008 19:45.
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 less number of states.
Abstract (in Czech)
Zabýváme se několika aspekty deterministických konečných automatů s více vstupy. Uvažujeme konverzi na deteministické konečné automaty. Dále ukazujeme, že se vyskytují jako minimální nedeterministické automaty pro jisté třídy jazyků. Konečně pojednáváme o jejich rozkladech na disjunktní sjednocení automatů s menším počtem stavů.
Links
1M0545, research and development projectName: Institut Teoretické Informatiky
Investor: Ministry of Education, Youth and Sports of the CR, Research Centres (National Research Programme)
PrintDisplayed: 26/5/2020 09:17