Author of the publication

Expressive Power of Pebble Automata.

, , , and . ICALP (1), volume 4051 of Lecture Notes in Computer Science, page 157-168. Springer, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Forest Expressions.. CSL, volume 4646 of Lecture Notes in Computer Science, page 146-160. Springer, (2007)Tree-Walking Automata Cannot Be Determinized., and . ICALP, volume 3142 of Lecture Notes in Computer Science, page 246-256. Springer, (2004)Reachability in Unions of Commutative Rewriting Systems Is Decidable., and . STACS, volume 4393 of Lecture Notes in Computer Science, page 622-633. Springer, (2007)Two-Way Alternating Automata and Finite Models.. ICALP, volume 2380 of Lecture Notes in Computer Science, page 833-844. Springer, (2002)Beyond omega-Regular Languages.. STACS, volume 5 of LIPIcs, page 11-16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Weak MSO+U over infinite trees., and . STACS, volume 14 of LIPIcs, page 648-660. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Which Classes of Origin Graphs Are Generated by Transducers., , , and . ICALP, volume 80 of LIPIcs, page 114:1-114:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)MSO+∇ is undecidable., , and . LICS, page 1-13. IEEE, (2019)Algebra for trees.. Handbook of Automata Theory (I.), European Mathematical Society Publishing House, Zürich, Switzerland, (2021)Transducers of polynomial growth.. LICS, page 1:1-1:27. ACM, (2022)