Aufsatz in einer Fachzeitschrift
Hierarchies of weakly monotone restarting automata
Details zur Publikation
Autor(inn)en: | Mraz, F.; Otto, F. |
Publikationsjahr: | 2005 |
Zeitschrift: | RAIRO: Theoretical Informatics and Applications |
Seitenbereich: | 325-342 |
Jahrgang/Band : | 39 |
ISSN: | 0988-3754 |
DOI-Link der Erstveröffentlichung: |
Zusammenfassung, 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.
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.
Projekte
