Decidability of equivalence for deterministic synchronized tree automata
From MaRDI portal
Publication:671682
DOI10.1016/0304-3975(96)00073-4zbMath0874.68211OpenAlexW2060424328MaRDI QIDQ671682
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(96)00073-4
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic top-down tree transducers with iterated look-ahead
- The equivalence problem for deterministic two-tape automata
- The equivalence problem of multitape finite automata
- Decidability of structural equivalence of E0L grammars
- 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
- Top-down tree transducers with deterministic top-down look-ahead
- Pushdown tree automata
- Deciding Equivalence of Finite Tree Automata
- Yield-languages recognized by alternating tree recognizers
- Top-down tree transducers with regular look-ahead
- Pumping, cleaning and symbolic constraints solving
- The equivalence problem for deterministic finite-turn pushdown automata
- Encompassment properties and automata with constraints
- Equality and disequality constraints on direct subterms in tree automata
- Mappings and grammars on trees
This page was built for publication: Decidability of equivalence for deterministic synchronized tree automata
