Implementation and Application of Automata

DOI10.1007/b105090zbMath1115.68419OpenAlexW4302765085WikidataQ56387363 ScholiaQ56387363MaRDI QIDQ5464009

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

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

Related Items (11)

Weighted tree automata and weighted logics ⋮ Compositions of tree series transformations ⋮ Weighted tree automata with constraints ⋮ Ambiguity Hierarchies for Weighted Tree Automata ⋮ Minimizing Deterministic Weighted Tree Automata ⋮ Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations ⋮ Weighted tree automata with constraints ⋮ Myhill-Nerode Theorem for Recognizable Tree Series Revisited ⋮ MAT learners for tree series: an abstract data type and two realizations ⋮ Minimizing deterministic weighted tree automata ⋮ Ambiguity hierarchies for weighted tree automata

This page was built for publication: Implementation and Application of Automata