scientific article; zbMATH DE number 1330134

MaRDI QIDQ4260705zbMATH OpenFDO

Authors Bruno Bogaert, F. Seynhaeve, Sophie Tison

Publication date 21 August 2000

zbMATH Keywords

term rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Unranked Tree Automata with Sibling Equalities and Disequalities
• Equality and disequality constraints on direct subterms in tree automata
• Recognizing relations by tree automata
• Projection for Büchi tree automata with constraints between siblings
• Projection for Büchi Tree Automata with Constraints between Siblings

Cited in

(11)

• Recognizable tree-languages and nonlinear morphisms
• Projection for Büchi tree automata with constraints between siblings
• The HOM problem is decidable
• Closure of tree automata languages under innermost rewriting
• The HOM problem is decidable
• Classes of Tree Homomorphisms with Decidable Preservation of Regularity
• Recognizing relations by tree automata
• Projection for Büchi Tree Automata with Constraints between Siblings
• The HOM problem is EXPTIME-complete
• Grid structures and undecidable constraint theories
• Finite combinatory logic with predicates

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4260705)