MINIMAL RECOGNIZERS AND SYNTACTIC MONOIDS OF DR TREE LANGUAGES

DOI10.1142/9789812810908_0012zbMath1499.68177OpenAlexW75055258MaRDI QIDQ5053730

Magnus Steinby, Ferenc Gécseg

Publication date: 6 December 2022

Published in: Words, Semigroups, and Transductions (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9789812810908_0012

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (5)

Algorithmic introduction of quantified cuts ⋮ Multiple context-free tree grammars: lexicalization and characterization ⋮ Composition closure of linear extended top-down tree transducers ⋮ Inductive theorem proving based on tree grammars ⋮ A link between multioperator and tree valuation automata and logics

This page was built for publication: MINIMAL RECOGNIZERS AND SYNTACTIC MONOIDS OF DR TREE LANGUAGES