POLÁK, Libor. Remarks on multiple entry deterministic finite automata. In Proc. Descriptional Complexity of Formal Systems 7th Workshop. Milano: Universita degli Studi di Milano, Departimento Di Informatica e Comunicazione, 2005. p. 261-268, 8 pp.
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 Milano, Proc. Descriptional Complexity of Formal Systems 7th Workshop, p. 261-268, 8 pp. 2005.
Publisher Universita degli Studi di Milano, Departimento Di Informatica e Comunicazione
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10101 Pure mathematics
Country of publisher Italy
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: 11/10/2007 15:26.
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áne 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 02:30