Decidability of equivalence for deterministic synchronized tree automata

DOI10.1007/3-540-59293-8_192MaRDI QIDQ5096728zbMATH OpenOpenAlexFDO

Authors Kai Salomaa

Publication date 18 August 2022

Published in TAPSOFT '95: Theory and Practice of Software Development (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59293-8_192

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Decidability of equivalence for deterministic synchronized tree automata
• Synchronized tree automata
• Decidability of equivalence for a class of non-deterministic tree transducers
• Deciding equivalence of finite tree automata
• scientific article; zbMATH DE number 1705162

Cites work

• Alternating tree automata
• Deterministic versus nondeterministic space in terms of synchronized alternating machines
• Encompassment properties and automata with constraints
• Equality and disequality constraints on direct subterms in tree automata
• scientific article; zbMATH DE number 3854429 (Why is no real title available?)
• scientific article; zbMATH DE number 4157904 (Why is no real title available?)
• scientific article; zbMATH DE number 17541 (Why is no real title available?)
• scientific article; zbMATH DE number 522869 (Why is no real title available?)
• On the power of synchronization in parallel computations
• Pumping, cleaning and symbolic constraints solving
• Synchronized finite automata and 2DFA reductions
• Synchronized tree automata
• The equivalence problem of multitape finite automata
• Top-down tree transducers with two-way tree walking look-ahead
• Variants of top-down tree transducers with look-ahead
• Yield-languages recognized by alternating tree recognizers

Cited in

(5)

• Synchronized tree automata
• scientific article; zbMATH DE number 1705162 (Why is no real title available?)
• scientific article; zbMATH DE number 1337729 (Why is no real title available?)
• Recognizing relations by tree automata
• Decidability of equivalence for deterministic synchronized tree automata

This page was built for publication: Decidability of equivalence for deterministic synchronized tree automata

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