Recommendations
- Constructions for alternating finite automata∗
- Alternating nonzero automata
- Alternating multihead finite automata
- scientific article; zbMATH DE number 3911710
- Alternating finite automata with limited universal branching
- scientific article; zbMATH DE number 3866588
- Alternating finite automata on -words
- Alternating finite automata and star-free languages
- Alternating tree automata
Cites work
- scientific article; zbMATH DE number 5595162 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1072535 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3254906 (Why is no real title available?)
- scientific article; zbMATH DE number 3269886 (Why is no real title available?)
- ${\text{ASPACE}}(o(\log \log n))$ is Regular
- A hierarchy that does not collapse : alternations in low level space
- Alternation
- Erratum to: Some observations concerning alternating Turing machines using small space
- Nondeterminism and the size of two way finite automata
- Nondeterministic Computations in Sublogarithmic Space and Space Constructibility
- Nondeterministic Space is Closed under Complementation
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
- On the state complexity of reversals of regular languages
- Optimal simulations between unary automata
- Size Complexity of Two-Way Finite Automata
- The Sublogarithmic Alternating Space World
- The alternation hierarchy for sublogarithmic space is infinite
- The method of forced enumeration for nondeterministic automata
Cited in
(23)- Width measures of alternating finite automata
- scientific article; zbMATH DE number 1759428 (Why is no real title available?)
- An oracle hierarchy for small one-way finite automata
- Alternating finite automata on \(\omega\)-words
- Existential and universal width of alternating finite automata
- Advice hierarchies among finite automata
- New size hierarchies for two way automata
- Synchronized finite automata and 2DFA reductions
- Alternation in two-way finite automata
- Implementation and Application of Automata
- Probabilism versus Alternation for Automata
- A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata
- scientific article; zbMATH DE number 3911710 (Why is no real title available?)
- Unambiguous and co-nondeterministic computations of finite automata and pushdown automata families and the effects of multiple counters
- Alternating finite automata and star-free languages
- A symbolic decision procedure for symbolic alternating finite automata
- On the state complexity of operations on two-way finite automata
- Possibilities of various types of alternating automata
- Two-way finite automata: old and recent results
- Converting finite width AFAs to nondeterministic and universal finite automata
- The state complexity of alternating automata
- scientific article; zbMATH DE number 1949664 (Why is no real title available?)
- Complement for two-way alternating automata
This page was built for publication: An alternating hierarchy for finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442279)
