Synchronized tree automata

DOI10.1016/0304-3975(94)90099-XMaRDI QIDQ1325832zbMATH OpenFDO

Authors Kai Salomaa

Publication date 15 May 1994

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

decision problemsclosure propertiessynchronized tree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Synchronised automata
• scientific article; zbMATH DE number 1705162
• scientific article; zbMATH DE number 826076
• On asynchronous tree automata
• Systolic tree and tree-like automata
• scientific article; zbMATH DE number 4030987
• Synchronized recursive timed automata
• Decidability of equivalence for deterministic synchronized tree automata
• Decidability of equivalence for deterministic synchronized tree automata
• scientific article; zbMATH DE number 3936542

Cites work

• scientific article; zbMATH DE number 17541 (Why is no real title available?)
• scientific article; zbMATH DE number 17554 (Why is no real title available?)
• scientific article; zbMATH DE number 3615891 (Why is no real title available?)
• scientific article; zbMATH DE number 1346513 (Why is no real title available?)
• scientific article; zbMATH DE number 3999901 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• Alternating tree automata
• Communication for alternating machines
• Deciding Equivalence of Finite Tree Automata
• Deterministic versus nondeterministic space in terms of synchronized alternating machines
• IO and OI. II
• Mappings and grammars on trees
• On the power of synchronization in parallel computations
• Pushdown tree automata
• The equivalence problem for deterministic finite-turn pushdown automata
• The equivalence problem for deterministic two-tape automata
• The equivalence problem of multitape finite automata
• Top-down tree transducers with deterministic top-down look-ahead
• Tree pushdown automata
• Un théorème de duplication pour les forets algébriques
• Yield-languages recognized by alternating tree recognizers

Cited in

(19)

• scientific article; zbMATH DE number 1405636 (Why is no real title available?)
• scientific article; zbMATH DE number 3988742 (Why is no real title available?)
• scientific article; zbMATH DE number 1390078 (Why is no real title available?)
• scientific article; zbMATH DE number 3954291 (Why is no real title available?)
• The generative capacity of block-synchronized context-free grammars
• scientific article; zbMATH DE number 1705162 (Why is no real title available?)
• scientific article; zbMATH DE number 1919508 (Why is no real title available?)
• Variable tree automata over infinite ranked alphabets
• Synchronization of Pushdown Automata
• Decidability of equivalence for deterministic synchronized tree automata
• Generalized synchronization trees
• Fibrations of tree automata
• scientific article; zbMATH DE number 2090087 (Why is no real title available?)
• On asynchronous tree automata
• Synchronization of Grammars
• Synchronization of Regular Automata
• Alphabetic and synchronized tree transducers
• On synchronizing tree automata and their work-optimal parallel run, usable for parallel tree pattern matching
• Decidability of equivalence for deterministic synchronized tree automata

This page was built for publication: Synchronized tree automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1325832)