Restarting Tree Automata

Formal Properties and Possible Variations

Stamer, Heiko

kassel university press, ISBN: 978-3-89958-634-3, 2009, 200 Pages

URN: urn:nbn:de:0002-6358

Zugl.: Kassel, Univ., Diss. 2008

Content: In the last years there was a growing effort to investigate language classes recognized by different variants of restarting automata. Moreover, tree automata have ained much attention in the computer science community, mainly due to their fruitful applications in abstract interpretation, automated theorem proving, logical reasoning, and program verification.

The subject of this book is a comprehensive study of a new tree automaton model - the so-called restarting tree automaton. The thesis explores the expressive power and the formal properties of this new model. Furthermore, some possible variations are considered.

Publication is available in following forms:

Full text (pdf-file, not printable - 1.33 MB)
view PDF
Full text (pdf-file, printable, with costs - 1.33 MB) 10.00 Euro
(free of charge in kassel University network - you are in kassel University network if you are in the workplace, or you are using a pc in the ITS or in the library)
download PDF - Attention! with costs, because you are not in kassel University network!