Code selection by tree series transducers

DOI10.1007/978-3-540-30500-2_6MaRDI QIDQ5464009zbMATH OpenOpenAlexDBLPFDO

Authors Björn Borchardt

Publication date 17 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b105090

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Formal languages and automata (68Q45)

Recommendations

• Tree automata for code selection
• Foundations of Software Science and Computation Structures
• scientific article; zbMATH DE number 1354999
• scientific article; zbMATH DE number 762057
• A note on binary grammatical codes of trees
• Binary Tree Code Words as Context-Free Languages
• Symbolic tree transducers
• Modular tree transducers
• scientific article; zbMATH DE number 4041320
• The Complexity of Tree Transducer Output Languages

Cited in

(14)

• Minimizing deterministic weighted tree automata
• Tree automata for code selection
• Ambiguity hierarchies for weighted tree automata
• Weighted tree automata with constraints
• scientific article; zbMATH DE number 4155861 (Why is no real title available?)
• Minimizing Deterministic Weighted Tree Automata
• Myhill-Nerode Theorem for Recognizable Tree Series Revisited
• Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
• Ambiguity Hierarchies for Weighted Tree Automata
• Weighted tree automata with constraints
• MAT learners for tree series: an abstract data type and two realizations
• Weighted tree automata and weighted logics
• Compositions of tree series transformations
• Code selection by inversion of order-sorted derivors

This page was built for publication: Code selection by tree series transducers

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