Basic tree transducers

DOI10.1016/0022-0000(87)90007-9MaRDI QIDQ579951zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 3965457
• Macro tree transducers
• Composition closure of linear extended top-down tree transducers
• Pushdown machines for the macro tree transducer
• scientific article; zbMATH DE number 3972227

Cites work

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

Cited in

(9)

• Tree transducers, \(L\) systems and two-way machines (extended abstract)
• scientific article; zbMATH DE number 3965457 (Why is no real title available?)
• Input strictly local tree transducers
• scientific article; zbMATH DE number 3972227 (Why is no real title available?)
• scientific article; zbMATH DE number 3945364 (Why is no real title available?)
• A complete rewriting system for a monoid of tree transformation classes
• Extended macro grammars and stack controlled machines
• Composition closure of \(\varepsilon \)-free linear extended top-down tree transducers
• scientific article; zbMATH DE number 2040925 (Why is no real title available?)

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)