Synchronized tree automata
From MaRDI portal
Publication:1325832
DOI10.1016/0304-3975(94)90099-XzbMath0805.68084MaRDI QIDQ1325832
Publication date: 15 May 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
DB lookup for MSC labels failed
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The equivalence problem for deterministic two-tape automata
- The equivalence problem of multitape finite automata
- On the power of synchronization in parallel computations
- Tree pushdown automata
- Alternating tree automata
- Communication for alternating machines
- Un théorème de duplication pour les forets algébriques
- IO and OI. II
- 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
- The equivalence problem for deterministic finite-turn pushdown automata
- Mappings and grammars on trees