Abstract
The most general models of restarting automata make use of auxiliary symbols in their rewrite operations. Here we put restrictions on the way in which restarting automata use auxiliary symbols, and we investigate the influence of these restrictions on their expressive power. In fact, we consider two types of restrictions. First, we consider the number of auxiliary symbols in the tape alphabet of a restarting automaton as a measure of its descriptional complexity. Secondly, we consider the number of occurrences of auxiliary symbols on the tape as a dynamic complexity measure. We establish some lower and upper bounds with respect to these complexity measures concerning the ability of restarting automata to recognize the (deterministic) context-free languages and some of their subclasses.
This work was supported by a grant from the Deutsche Forschungsgemeinschaft. It was performed while Tomasz Jurdziński was visiting the University of Kassel.
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)
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)
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, Institut für Informatik, Technische Universität München, pp. 90–96 (2003)
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, DLT 1999, pp. 103–114. World Scientific, Singapore (2000)
Niemann, G., Otto, F.: Further results on restarting automata. In: Ito, M., Imaoka, T. (eds.) Words, Languages and Combinatorics III, pp. 352–369. World Scientific, Singapore (2003)
McNaughton, R., Narendran, P., Otto, F.: Church-Rosser Thue systems and formal languages. J. Assoc. Comput. Mach. 35, 324–344 (1988)
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.: Restarting automata with restricted utilization of auxiliary symbols. Mathematische Schriften Kassel 2/05, Universität Kassel (2005)
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)
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., Otto, F., Mráz, F., Jurdziński, T.: Restarting automata and variants of j-monotonicity. Mathematische Schriften Kassel 9/03, Universität Kassel (2003)
Jurdziński, T., Otto, F., Mráz, F., Plátek, M.: On the complexity of 2-monotone restarting automata. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 237–248. Springer, Heidelberg (2004)
Hemaspaandra, L., Mukherji, P., Tantau, T.: Computation with absolutely no space overhead. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 325–336. Springer, Heidelberg (2003)
Hemaspaandra, L., Mukherji, P., Tantau, T.: Overhead-free computation, dcfls, and cfls. In: The Computing Research Repository cs. CC/0410035 (2004)
Salomaa, A.: Formal Languages. Academic Press, London (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jurdziński, T., Otto, F. (2006). Restricting the Use of Auxiliary Symbols for Restarting Automata. In: Farré, J., Litovsky, I., Schmitz, S. (eds) Implementation and Application of Automata. CIAA 2005. Lecture Notes in Computer Science, vol 3845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11605157_15
Download citation
DOI: https://doi.org/10.1007/11605157_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31023-5
Online ISBN: 978-3-540-33097-4
eBook Packages: Computer ScienceComputer Science (R0)