Tree Automata

Abstract

This is a reissue of the book Tree Automata by F. Gécseg and M. Steinby originally published in 1984 by Akadémiai Kiadó, Budapest. Some mistakes have been corrected and a few obscure passages have been clarified. Moreover, some more recent contributions and current lines of research are reviewed in an appendix that also contains several new references.

Cited by in corpus (3)

• Colored operads, series on colored operads, and combinatorial generating systems
• Pushing for weighted tree automata
• A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage