Decidability of equivalence for deterministic synchronized tree automata
From MaRDI portal
Publication:671682
DOI10.1016/0304-3975(96)00073-4zbMATH Open0874.68211OpenAlexW2060424328MaRDI QIDQ671682FDOQ671682
Authors: Kai Salomaa 
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
Recommendations
Cites Work
- Top-down tree transducers with regular look-ahead
- Title not available (Why is that?)
- Deciding Equivalence of Finite Tree Automata
- Decidability of structural equivalence of E0L grammars
- Equality and disequality constraints on direct subterms in tree automata
- Mappings and grammars on trees
- The equivalence problem for deterministic finite-turn pushdown automata
- The equivalence problem of multitape finite automata
- Alternating tree automata
- Top-down tree transducers with deterministic top-down look-ahead
- Deterministic top-down tree transducers with iterated look-ahead
- Pushdown tree automata
- Encompassment properties and automata with constraints
- Synchronized tree automata
- Deterministic versus nondeterministic space in terms of synchronized alternating machines
- On the power of synchronization in parallel computations
- The equivalence problem for deterministic two-tape automata
- Top-down tree transducers with two-way tree walking look-ahead
- Synchronized finite automata and 2DFA reductions
- Title not available (Why is that?)
- Yield-languages recognized by alternating tree recognizers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pumping, cleaning and symbolic constraints solving
Cited In (2)
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 Q671682)
