Abstract
We study transformations of automata from some (sub)classes of restarting automata (RRWW-automata) into two types of special forms. We stress particularly the transformations into the linguistically motivated weak cyclic form. Special forms of the second type express a certain degree of determinism of such automata.
Similar content being viewed by others
References
Jančar, P., F. Mráz, M. Plátek and J. Vogel. On monotony for restarting automata, In M. Kudlek, editor, Proc. MFCS'98 workshop 'Mathematical Linguistics', 71–84, Bericht 213, Universität Hamburg, Fachbereich Informatik, 1998.
Kuboň, V. and M. Plátek. A grammar based approach to a grammar checking of free word order languages, In Proc. of the 15th Intern. Conf. on Computational Linguistics COLING 94, Vol. II, 906–910, Kyoto, 1994.
Marcus, S. Contextual grammars and natural languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, Volume 2, 215–235, Springer Verlag, Berlin, 1997.
Plátek, M. Weak cyclic forms of restarting automata (extended abstract), In W. Thomas, editor, Preproc. of DLT 99, 63–72, Aachen, 1999.
Plátek, M. Weak cyclic forms of restarting automata, Tech. Rep. No 99/4, KTI MFF of Charles University, Prague, 1999.
Păun, Gh. Marcus Contextual Grammars, Kluwer Academic Publishers, Dordrecht, 1997.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mráz, F., Plátek, M. & Procházka, M. On Special Forms of Restarting Automata*. Grammars 2, 223–233 (1999). https://doi.org/10.1023/A:1009918602528
Issue Date:
DOI: https://doi.org/10.1023/A:1009918602528