scientific article

zbMATH Open0787.68072MaRDI QIDQ4036177FDOQ4036177

Kai Salomaa

Publication date: 16 May 1993

Title of this publication is not available (Why is that?)

zbMATH Keywords

tree automataalternating tree recognizeralternation depth boundsmodeling of parallelism

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• Alternating tree automata
• Alternating Tree Automata and Parity Games
• Stochastically costed tree automata: Turakainen's theorem
• Emptiness Of Alternating Tree Automata Using Games With Imperfect Information

Recommendations

• Alternating automata on infinite trees 👍 👎
• Tree Automata over Infinite Alphabets 👍 👎
• Alternating tree automata 👍 👎
• Alternating automata, the weak monadic theory of trees and its complexity 👍 👎
• On a representation of tree automata 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)