Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-13T11:01:54.546Z Has data issue: false hasContentIssue false
  • English
  • Français

Sequential monotonicity for restarting automata

Published online by Cambridge University Press:  18 July 2007

Tomasz Jurdziński and
Friedrich Otto
Tomasz Jurdziński
Affiliation:
Institute of Computer Science, University of Wrocław, 51-151 Wrocław, Poland; tju@ii.uni.wroc.pl
Friedrich Otto
Affiliation:
Fachbereich Elektrotechnik/Informatik, Universität Kassel, 34109 Kassel, Germany; otto@theory.informatik.uni-kassel.de
Get access

Abstract

As already 2-monotone R-automata accept NP-complete languages,we introduce a restricted variant of j-monotonicityfor restarting automata, called sequential j-monotonicity.For restarting automata without auxiliary symbols,this restricted variant still yields infinite hierarchies.However, for restarting automata with auxiliary symbols,all degrees of sequential monotonicity collapse to thefirst level, implying that RLWW-automatathat are sequentially monotone of degree j for any j ≥ 1 only accept context-free languages.

Keywords

Restarting automatonsequential monotonicityhierarchies

Information

Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 41 , Issue 2 , April 2007, pp. 157 - 175
Copyright
© EDP Sciences, 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

J. Berstel. Transductions and Context-Free Languages. Teubner, Stuttgart (1979).
R.V. Book and F. Otto, String-Rewriting Systems. Springer, New York (1993).
R. Cremanns and F. Otto, The language of final stack contents of a pushdown automaton is effectively regular. Mathematische Schriften Kassel 11/93, Universität Kassel (1993).
Greibach, S., A note on pushdown store automata and regular systems. Proc. Amer. Math. Soc. 18 (1967) 263–268. CrossRef
Jančar, P., Mráz, F., Plátek, M. and Vogel, J.. Restarting automata, in FCT'95, Proc., edited by H. Reichel, Springer, Berlin. Lect. Notes Comput. Sci. 965 (1995) 283–292. CrossRef
Jančar, P., Mráz, F., Plátek, M. and Vogel, J., On monotonic automata with a restart operation. J. Autom. Lang. Comb. 4 (1999) 287–311.
Jurdziński, T., Loryś, K., Niemann, G. and Otto, F., Some results on RWW- and RRWW-automata and their relation to the class of growing context-sensitive languages. J. Autom. Lang. Comb. 9 (2004) 407–437.
Jurdziński, T., Otto, F., Mráz, F. and Plátek, M., On the complexity of 2-monotone restarting automata, in DLT 2004, Proc., edited by C.S. Calude, E. Calude and M.J. Dinneen, Springer, Berlin. Lect. Notes Comput. Sci. 3340 (2004) 237–248. CrossRef
Jurdziński, T., Mráz, F., Otto, F. and Plátek, M., Degrees of non-monotonicity for restarting automata. Theoret. Comput. Sci. 369 (2006) 1–34. CrossRef
G. Niemann and F. Otto, Further results on restarting automata, in Words, Languages and Combinatorics III, Proc., edited by M. Ito and T. Imaoka. World Scientific, Singapore (2003) 352–369.
Oliva, K., Květoň, P. and Ondruška, R., The computational complexity of rule-based part-of-speech tagging, in TSD 2003, Proc., edited by V. Matousek and P. Mautner, Springer, Berlin. Lect. Notes Comput. Sci. 2807 (2003) 82–89. CrossRef
Otto, F., Restarting automata and their relations to the Chomsky hierarchy, in Developments in Language Theory, Proc. DLT'2003, edited by Z. Esik and Z. Fülöp, Springer, Berlin. Lect. Notes Comput. Sci. 2710 (2003) 55–74. CrossRef
Otto, F., Restarting Automata, in Recent Advances in Formal Languages and Applications, Z. Ésik, C. Martin-Vide and V. Mitrana (Eds.), Springer, Berlin. Stud. Comput. Intelligence 25 (2006) 269–303.
Plátek, M., Two-way restarting automata and j-monotonicity, in Theory and Practice of Informatics, Proc. SOFSEM 2001, edited by L. Pacholski and P. Ružička, Springer-Verlag, Berlin. Lect. Notes Comput. Sci. 2234 (2001) 316–325. CrossRef
M. Plátek and F. Mráz, Degrees of (non)monotonicity of RRW-automata, in Preproceedings of the 3rd Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, Report No. 16, edited by J. Dassow and D. Wotschke, Fakultät für Informatik, Universität Magdeburg (2001) 159–165.
M. Plátek, M. Lopatková and K. Oliva, Restarting automata: motivations and applications. In Workshop `Petrinetze' and 13. Theorietag `Formale Sprachen und Automaten', Proc., edited by M. Holzer, Institut für Informatik, Technische Universität München (2003) 90–96.