Restarting Tree Automata

Authors:
Heiko Stamer;Friedrich Otto
Affiliations:
Fachbereich Mathematik/Informatik, Universität Kassel, D-34109 Kassel, Germany;Fachbereich Mathematik/Informatik, Universität Kassel, D-34109 Kassel, Germany
Venue:
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Year:
2007

Citing 10
Cited 1

Tree languages

Handbook of formal languages, vol. 3
Basics of term rewriting

Handbook of formal languages, vol. 3
On monotonic automata with a restart operation

Journal of Automata, Languages and Combinatorics
On Restarting Automata with Rewriting

New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Some results on RWW- and RRWW-automata and their relation to the class of growing context-sensitive languages

Journal of Automata, Languages and Combinatorics
Un théorème de duplication pour les forêts algébriques

Journal of Computer and System Sciences
Restarting automata and their relations to the Chomsky hierarchy

DLT'03 Proceedings of the 7th international conference on Developments in language theory
On nonforgetting restarting automata that are deterministic and/or monotone

CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Shrinking restarting automata

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Modeling syntax of free word-order languages: dependency analysis by reduction

TSD'05 Proceedings of the 8th international conference on Text, Speech and Dialogue

Single-Path Restarting Tree Automata

CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Restarting automata were introduced to model the linguistic concept of analysis by reduction. In recent years there was a growing effort to study classes of formal languages that are generated by different variants of these automata. We follow this line of research and generalize the model to a more complex data structure: free term algebras (or trees). Many of the known results about restarting automata on strings carry over to the new model. We study the expressive power of restarting tree automata and prove some closure properties.