Publication:579951

DOI10.1016/0022-0000(87)90007-9zbMATH Open0625.68061OpenAlexW2069933339MaRDI QIDQ579951FDOQ579951

Heiko Vogler

Publication date: 1987

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(87)90007-9

zbMATH Keywords

basic tree transducercontrol on linear grammarspath languagespushdown machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bottom-up and top-down tree transformations— a comparison
• Top-down tree transducers with regular look-ahead
• IO and OI. II
• Attribute grammars and recursive program schemes. I. II
• The IO- and OI-hierarchies
• An automata-theoretical characterization of the OI-hierarchy
• Indexed Grammars—An Extension of Context-Free Grammars
• Nested Stack Automata
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Finite-Turn Pushdown Automata
• Generalized sequential machine maps
• Mappings and grammars on trees
• Full AFLs and nested iterated substitution
• Tree transducers, L systems, and two-way machines
• Three hierarchies of transducers
• Macro tree transducers
• Pushdown tree automata
• Stack Machines and Classes of Nonnested Macro Languages
• Extended macro grammars and stack controlled machines
• Pushdown machines for the macro tree transducer
• A representation of trees by languages. II
• A geometric hierarchy of languages
• Control sets on context-free grammar forms
• One way finite visit automata
• Checking automata and one-way stack languages
• On the equivalence problem for attribute systems
• Bounded nesting in macro grammars
• Extension of tabled 0L-systems and languages
• Control sets on linear grammars
• Control sets on grammars
• Look-ahead on pushdowns
• Linear indexed languages

Cited In (1)

• A complete rewriting system for a monoid of tree transformation classes

This page was built for publication: Basic tree transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579951)