@inproceedings{StamerOtto:2007:SOFSEM,
title = {Restarting {T}ree {A}utomata},
author = {Heiko Stamer and Friedrich Otto},
booktitle = {SOFSEM 2007},
editor = {Jan van Leeuwen et al.},
pages = {510--521},
publisher = {Springer-Verlag},
series = {Lecture Notes in Computer Science},
volume = {4362},
year = {2007},
description = {My publications},
abstract = {Restarting automata were introduced to model the
linguistic concept of \emph{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.},
issn = {0302-9743}, isbn = {978-3-540-69506-6},
keywords = {automata formal languages nlp }
}
::