@stefano

Restarting Tree Automata

, and . SOFSEM 2007, volume 4362 of Lecture Notes in Computer Science, page 510--521. Springer-Verlag, (2007)

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.

Description

My publications

Links and resources

Tags

community

  • @stamer
  • @dblp
  • @stefano
@stefano's tags highlighted