Decidability of equivalence for deterministic synchronized tree automata
From MaRDI portal
Publication:5096728
Recommendations
Cites work
- 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?)
- 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
- 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
(3)
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)