scientific article; zbMATH DE number 168434

MaRDI QIDQ4036177zbMATH OpenFDO

Authors Kai Salomaa

Publication date 16 May 1993

zbMATH Keywords

alternating tree recognizeralternation depth boundsmodeling of parallelismtree automata

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45)

Recommendations

• Alternating tree automata
• Alternating automata on infinite trees
• scientific article; zbMATH DE number 7649889
• Alternating automata, the weak monadic theory of trees and its complexity
• scientific article; zbMATH DE number 3999901
• L-valued alternating tree automata
• On a representation of tree automata
• scientific article; zbMATH DE number 4083011
• Tree Automata over Infinite Alphabets
• Alternating weak automata from universal trees

Cited in

(6)

• Alternating tree automata
• Stochastically costed tree automata: Turakainen's theorem
• Emptiness Of Alternating Tree Automata Using Games With Imperfect Information
• scientific article; zbMATH DE number 3967934 (Why is no real title available?)
• scientific article; zbMATH DE number 475614 (Why is no real title available?)
• Alternating Tree Automata and Parity Games

This page was built for publication:

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