Hostname: page-component-76fb5796d-25wd4 Total loading time: 0 Render date: 2024-04-25T14:25:38.117Z Has data issue: false hasContentIssue false
  • English
  • Français

Hierarchies of weakly monotone restarting automata

Published online by Cambridge University Press:  15 April 2005

František Mráz  and
Friedrich Otto
František Mráz
Affiliation:
Department of Computer Science, Charles University, Malostranské nám. 25, 118 00 Praha 1, Czech Republic; mraz@ksvi.ms.mff.cuni.cz
Friedrich Otto
Affiliation:
Fachbereich Mathematik/Informatik, Universität Kassel, 34109 Kassel, Germany; otto@theory.informatik.uni-kassel.de
Get access

Abstract

It is known that the weakly monotone restarting automata accept exactly the growing context-sensitive languages. We introduce a measure on the degree of weak monotonicity and show that the language classes obtained in this way form strict hierarchies for the various types of deterministic and nondeterministic restarting automata without auxiliary symbols.

Keywords

Restarting automataweak monotonicityhierarchies
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 39 , Issue 2 , April 2005 , pp. 325 - 342
Copyright
© EDP Sciences, 2005

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.)

References

Dahlhaus, E. and Warmuth, M.K., Membership for growing context-sensitive grammars is polynomial. J. Comput. Syst. Sci. 33 (1986) 456–472. CrossRef
P. Jančar, F. Mráz, M. Plátek and J. Vogel, Restarting automata, in Proc. FCT'95, edited by H. Reichel. Springer, Berlin, Lect. Notes Comput. Sci. 965 (1995) 283–292.
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.
T. Jurdziński, K. Loryś, G. Niemann and F. Otto, Some results on RWW- and RRWW-automata and their relationship to the class of growing context-sensitive languages. Tech. Report 14/01, Fachbereich Mathematik/Informatik, Universität Kassel (2001). Also: To appear in revised form in the J. Autom. Lang. Comb.
McNaughton, R., Narendran, P. and Otto, F., Church-Rosser Thue systems and formal languages. J. Assoc. Comput. Mach. 35 (1988) 324–344.
P. Narendran, Church-Rosser and related Thue systems. Ph.D. Thesis, Rensselaer Polytechnic Institute, Troy, New York (1984).
G. Niemann and F. Otto, The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages, in Proc. FoSSaCS'98, edited by M. Nivat. Springer, Berlin, Lect. Notes Comput. Sci. 1378 (1998) 243–257.
G. Niemann and F. Otto, On the power of RRWW-automata, in Words, Semigroups, and Transductions, edited by M. Ito, G. Păun and S. Yu. World Scientific, Singapore (2001) 341–355.
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.
Straňáková, M., Selected types of pg-ambiguity. The Prague Bulletin of Mathematical Linguistics 72 (1999) 29–57.
M. Straňáková, Selected types of pg-ambiguity: Processing based on analysis by reduction, in Text, Speech and Dialogue, 3rd Int. Workshop, Proc., edited by P. Sojka, I. Kopeček and K. Pala. Springer, Berlin, Lect. Notes Comput. Sci. 1902 (2000) 139–144.