On reverse and general definite tree languages

DOI10.1007/3-540-55719-9_71zbMath1425.68225OpenAlexW95506514MaRDI QIDQ5204314

Pierre Péladeau, Andreas Podelski

Publication date: 4 December 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55719-9_71

zbMATH Keywords

normal formtree languagetree automatonsyntactic semigroup

Mathematics Subject Classification ID

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

Related Items

Rabin tree automata and finite monoids ⋮ Algebras for classifying regular tree languages and an application to frontier testability ⋮ An algebraic characterization of frontier testable tree languages ⋮ General varieties of tree languages

Cites Work

• Generalized finite automata theory with an application to a decision problem of second-order logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item