Decidability of equivalence for deterministic synchronized tree automata

DOI10.1007/3-540-59293-8_192zbMath1496.68180OpenAlexW2133834130MaRDI QIDQ5096728

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equivalence problem of multitape finite automata
• On the power of synchronization in parallel computations
• Alternating tree automata
• Top-down tree transducers with two-way tree walking look-ahead
• Synchronized finite automata and 2DFA reductions
• Synchronized tree automata
• Deterministic versus nondeterministic space in terms of synchronized alternating machines
• Yield-languages recognized by alternating tree recognizers
• Variants of top-down tree transducers with look-ahead
• Pumping, cleaning and symbolic constraints solving
• Encompassment properties and automata with constraints
• Equality and disequality constraints on direct subterms in tree automata

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