Tree automata and attribute grammars
From MaRDI portal
Publication:3341934
Recommendations
Cited in
(15)- The time complexity of typechecking tree-walking tree transducers
- One-pass transformations of attributed program trees
- 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
- The generating power of total deterministic tree transducers
- Attributed tree grammars
- Composing stack-attributed tree transducers
- Domains of partial attributed tree transducers
- Automaton model of visual description of syntax parsing
- Machines for attribute grammars
- Functions of binary trees and their applications in algorithm complexity analysis
- Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition
- scientific article; zbMATH DE number 1200800 (Why is no real title available?)
- Rule-restricted automaton-grammar transducers: power and linguistic applications
This page was built for publication: Tree automata and attribute grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3341934)