Implementation and Application of Automata
From MaRDI portal
Publication:5464009
DOI10.1007/B105090zbMATH Open1115.68419DBLPconf/wia/2004OpenAlexW4302765085MaRDI QIDQ5464009FDOQ5464009
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
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)
- Myhill-Nerode Theorem for Recognizable Tree Series Revisited
- Weighted tree automata and weighted logics
- MAT learners for tree series: an abstract data type and two realizations
- Minimizing Deterministic Weighted Tree Automata
- Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
- Weighted tree automata with constraints
- Tree automata for code selection
- Title not available (Why is that?)
- Weighted tree automata with constraints
- Compositions of tree series transformations
- Ambiguity Hierarchies for Weighted Tree Automata
- Minimizing deterministic weighted tree automata
- Code selection by inversion of order-sorted derivors
- Ambiguity hierarchies for weighted tree automata
This page was built for publication: Implementation and Application of Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464009)
