Abstract
It is known that for monotone deterministic one-way restarting automata, the use of auxiliary symbols does not increase the expressive power. Here we show that the same is true for deterministic two-way restarting automata that are right- or left-monotone. Actually in these cases it suffices to admit delete operations instead of the more general rewrite operations. In addition, we characterize the classes of languages that are accepted by these types of two-way restarting automata by certain combinations of deterministic pushdown automata and deterministic transducers.
The work of the first and third authors was supported by a grant from the Deutsche Forschungsgemeinschaft. It was performed while T. Jurdziński was visiting the University of Kassel. The second and forth authors were partially supported by the Grant Agency of the Czech Republic under Grant-No. 201/04/2102 and by the program ‘Information Society’ under project 1ET100300517
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, V., Hopcroft, J.E., Ullman, J.D.: A General Theory of Translation. Math. Systems Theory 3, 193–221 (1969)
Hopcroft, J.E., Ullman, J.D.: An approach to a unified theory of automata. Bell System Tech. J. 46, 1793–1829 (1967)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
Jančar, P., Mráz, F., Plátek, M.: Monotonicity of restarting automata. J. Autom. Lang. Comb. (to appear)
Jančar, P., Mráz, F., Plátek, M., Vogel, J.: Restarting automata. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 283–292. Springer, Heidelberg (1995)
Jančar, P., Mráz, F., Plátek, M., Vogel, J.: On Monotonic Automata with a Restart Operation. J. Autom. Lang. Comb. 4, 283–292 (1999)
Jurdziński, T., Otto, F., Mráz, F., Plátek, M.: On left-monotone deterministic restarting automata. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 249–260. Springer, Heidelberg (2004)
Jurdziński, T., Otto, F., Mráz, F., Plátek, M.: Deterministic two-way restarting automata and Marcus contextual grammars. Fund. Inform. 64, 217–228 (2005)
Oliva, K., Květoň, P., Ondruška, R.: The computational complexity of rule-based part-of-speech tagging. In: Matoušek, V., Mautner, P. (eds.) TSD 2003. LNCS (LNAI), vol. 2807, pp. 82–89. Springer, Heidelberg (2003)
Otto, F.: Restarting Automata - Notes for a Course at the 3rd International PhD School in Formal Languages and Applications. Mathematische Schriften Kassel 6/04, Universität Kassel (2004)
Otto, F., Jurdziński, T.: On Left-monotone Restarting Automata, Mathematische Schriften Kassel 17/03, Universität Kassel (2003)
Plátek, M.: Two-way restarting automata and J-monotonicity. In: Pacholski, L., Ružička, P. (eds.) SOFSEM 2001. LNCS, vol. 2234, pp. 316–325. Springer, Heidelberg (2001)
Plátek, M., Lopatková, M., Oliva, K.: Restarting automata: motivations and applications. In: M. Holzer (ed.) Workshop ‘Petrinetze’ and 13. Theorietag ‘Formale Sprachen und Automaten’, Proc., Institut für Informatik, Technische Universität München, pp. 90–96 (2003)
Plátek, M., Otto, F., Mráz, F.: Restarting automata and variants of jmonotonicity. In: Csuhaj-Varjú, E., Kintala, C., Wotschke, D., Vaszil, G. (eds.) Descriptional Complexity of Formal Systems, Proc. DCFS 2003, MTA SZTAKI, Budapest, pp. 303–312 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jurdziński, T., Mráz, F., Otto, F., Plátek, M. (2005). Monotone Deterministic RL-Automata Don’t Need Auxiliary Symbols. In: De Felice, C., Restivo, A. (eds) Developments in Language Theory. DLT 2005. Lecture Notes in Computer Science, vol 3572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11505877_25
Download citation
DOI: https://doi.org/10.1007/11505877_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26546-7
Online ISBN: 978-3-540-31682-4
eBook Packages: Computer ScienceComputer Science (R0)