Controlled finite automata
- 243 Downloads
This paper discusses finite automata regulated by control languages over their states and transition rules. It proves that under both regulations, regular-controlled finite automata and context-free-controlled finite automata characterize the family of regular languages and the family of context-free languages, respectively. It also establishes conditions under which any state-controlled finite automaton can be turned into an equivalent transition-controlled finite automaton and vice versa. The paper also demonstrates a close relation between these automata and programmed grammars. Indeed, it proves that finite automata controlled by languages generated by propagating programmed grammars with appearance checking are computationally complete. In fact, it demonstrates that this computational completeness holds even in terms of these automata with a reduced number of states.
KeywordsTuring Machine Transitive Closure Regular Language Finite Automaton Derivation Step
This work was supported by the following grants: MŠMT CZ1.1.00/02.0070 and TAČR TE01010415. The authors thank the anonymous referee for useful comments regarding the first version of this paper.
- 1.Csuhaj-Varjú, E., Masopust, T., Vaszil, G.: Blackhole state-controlled regulated pushdown automata. In: Second Workshop on Non-Classical Models for Automata and Applications (NCMA 2010) pp. 45–56 (2010)Google Scholar
- 4.Hopcroft, J., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Boston (2000)Google Scholar
- 5.Jantzen, M., Kudlek, M., Zetzsche, G.: Finite automata controlled by Petri nets. In: Proceedings of the 14th Workshop; Algorithmen und Werkzeuge für Petrinetze. Technical Report Nr. 25/2007, pp. 57–62. Universität Koblenz-Landau (2007)Google Scholar
- 6.Kolář, D., Meduna, A.: Regulated pushdown automata. Acta Cybern. 2000(4), 653–664 (2000)Google Scholar
- 7.Kolář, D., Meduna, A.: One-turn regulated pushdown automata and their reduction. Fundam. Inform. 2001(21), 1001–1007 (2001)Google Scholar
- 8.Kolář, D., Meduna, A.: Regulated automata: from theory towards applications. In: Proceeding of 8th International Conference on Information Systems Implementation and Modelling (ISIM’05) pp. 33–48 (2005)Google Scholar
- 11.Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, Vol. 2: Linear Modeling: Background and Application. Springer, New York (1997)Google Scholar
- 12.Rychnovský, L.: Regulated pushdown automata revisited. In: Proceedings of the 15th Conference STUDENT EEICT 2009, pp. 440–444. Faculty of Information Technology BUT, Brno, CZ (2009)Google Scholar
- 13.Wood, D.: Theory of Computation: A Primer. Addison-Wesley, Boston (1987)Google Scholar