Recognizing relations by tree automata

DOI10.25596/JALC-2013-113MaRDI QIDQ5507087zbMATH OpenFDO

Authors Sándor Vágvölgyi

Publication date 16 December 2016

Full work available at URL https://doi.org/10.25596/JALC-2013-113

zbMATH Keywords

formal languagesrecognizable relationstree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On ground tree transformations and congruences induced by tree automata.
• scientific article; zbMATH DE number 1330134
• Decidability of equivalence for deterministic synchronized tree automata
• Decidability of equivalence for deterministic synchronized tree automata
• Relating word and tree automata

Cited in

(5)

• On ground tree transformations and congruences induced by tree automata.
• Beyond representing orthology relations by trees
• scientific article; zbMATH DE number 1330134 (Why is no real title available?)
• scientific article; zbMATH DE number 1136080 (Why is no real title available?)
• An Automata Theoretic Approach to Rational Tree Relations

This page was built for publication: Recognizing relations by tree automata

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