Tree automata and attribute grammars

DOI10.1016/S0019-9958(83)80021-7zbMath0549.68080OpenAlexW2082342397MaRDI QIDQ3341934

Tsutomu Kamimura

Publication date: 1983

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(83)80021-7

zbMATH Keywords

tree automataattribute grammarspushdown tree-to-string transducertree-walking finite state automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Domains of partial attributed tree transducers ⋮ Pushdown machines for the macro tree transducer ⋮ Generalized automata on infinite trees and Muller-McNaughton's theorem ⋮ Top-down tree transducers with two-way tree walking look-ahead ⋮ Functions of binary trees and their applications in algorithm complexity analysis ⋮ The time complexity of typechecking tree-walking tree transducers