Recognizable tree-languages and nonlinear morphisms

DOI10.1016/S0304-3975(02)00014-2zbMath1014.68092OpenAlexW2049463663MaRDI QIDQ1603692

Marc Tommasi, Max Dauchet, Sophie Tison

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00014-2

zbMATH Keywords

cross-section theoremquasi-alphabetic homomorphismtree morphisms

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

The HOM Problem is EXPTIME-Complete

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rational bijection of rational sets
• Morphismes et bimorphismes d'arbres
• Transductions des langages de Chomsky
• Linearizing term rewriting systems using test sets
• Decidability of regularity and related properties of ground normal form languages
• Bottom-up and top-down tree transformations— a comparison
• Pumping, cleaning and symbolic constraints solving
• On relationship between term rewriting systems and regular tree languages
• Encompassment properties and automata with constraints
• Equality and disequality constraints on direct subterms in tree automata

This page was built for publication: Recognizable tree-languages and nonlinear morphisms