Abstract
The notion of left-monotonicity is introduced for the restarting automaton, and the expressive power of the various types of left-monotone restarting automata is studied. We concentrate on the deterministic classes, as here the results differ greatly from those for the corresponding classes of (right-) monotone restarting automata.
The work of the first two authors was supported by a grant from the Deutsche Forschungsgemeinschaft. The third and the forth authors were supported by the Grant Agency of the Czech Republic, Grant-No. 201/02/1456, and Grant No. 201/04/2102.
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
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. and Comb 4, 287–311 (1999)
Mráz, F., Otto, F., Plátek, M.: Restarting automata and combinations of constraints. In: Vojtáš, P. (ed.) ITAT 2003: Information Technologies - Applications and Theory, Proc. Department of Computer Science, pp. 83–91. Faculty of Science, Pavol Josef Šafárik University, Košice (2004)
Niemann, G., Otto, F.: The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 243–257. Springer, Heidelberg (1998)
Niemann, G., Otto, F.: Restarting automata, Church-Rosser languages, and representations of r.e. languages. In: Rozenberg, G., Thomas, W. (eds.) Developments in Language Theory - Foundations, Applications, and Perspectives, Proc. DLT 1999, pp. 103–114. World Scientific, Singapore (2000)
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 and their relations to the Chomsky hierarchy. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 55–74. Springer, Heidelberg (2003)
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: Holzer, M. (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., Mráz, F.: Degrees of (non)monotonicity of RRW-automata. In: Dassow, J., Wotschke, D. (eds.) Preproceedings of the 3rd Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, Report No. 16, pp. 159–165. Fakultät für Informatik, Universität Magdeburg (2001)
Plátek, M., Otto, F., Mráz, F.: Restarting automata and variants of j-monotonicity. In: Csuhaj-Varjú, E., Kintala, C., Wotschke, D. (eds.) Descriptional Complexity of Formal Systems, Proceedings DCFS 2003, MTA SZTAKI, Budapest, pp. 303–312 (2003)
Plátek, M., Otto, F., Mráz, F., Jurdziński, T.: Restarting automata and variants of j-monotonicity. Mathematische Schriften Kassel 9/03, Universität Kassel (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jurdziński, T., Otto, F., Mráz, F., Plátek, M. (2004). On Left-Monotone Deterministic Restarting Automata. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds) Developments in Language Theory. DLT 2004. Lecture Notes in Computer Science, vol 3340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30550-7_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-30550-7_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24014-3
Online ISBN: 978-3-540-30550-7
eBook Packages: Computer ScienceComputer Science (R0)