Constructions for alternating finite automata∗
From MaRDI portal
DOI10.1080/00207169008803893zbMATH Open0699.68081DBLPjournals/ijcm/FellahJY90OpenAlexW2032001066WikidataQ56431187 ScholiaQ56431187MaRDI QIDQ3477972FDOQ3477972
Authors:
Publication date: 1990
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169008803893
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Alternation
- On alternation
- Title not available (Why is that?)
- Alternating Pushdown and Stack Automata
- Tree-size bounded alternation
- A note on alternating on-line Turing machines
- Some observations concerning alternating Turing machines using small space
- Alternating multicounter machines with constant number of reversals
- On the power of alternation in automata theory
- Alternation and \(\omega\)-type Turing acceptors
Cited In (30)
- Title not available (Why is that?)
- Alternation Elimination by Complementation (Extended Abstract)
- From bidirectionality to alternation.
- Linear parsing expression grammars
- Square on Deterministic, Alternating, and Boolean Finite Automata
- Method of Constructing Two-Way Alternating Automata for PSL and Translation to Nondeterministic Automata
- Construction of Aho Corasick automaton in linear time for integer alphabets
- The state complexities of some basic operations on regular languages
- A construction on finite automata that has remained hidden
- Descriptional complexity of the forever operator
- An alternating hierarchy for finite automata
- Equations and regular-like expressions for afa
- Alternation in two-way finite automata
- Descriptional and Computational Complexity of Finite Automata
- Title not available (Why is that?)
- Alternating finite automata on \(\omega\)-words
- The complexity of concatenation on deterministic and alternating finite automata
- Alternating finite automata and star-free languages
- Efficient implementation of regular languages using reversed alternating finite automata
- Operations on Boolean and Alternating Finite Automata
- Domain mu-calculus
- Reasoning About Regular Properties: A Comparative Study
- Descriptional and computational complexity of finite automata -- a survey
- Existential and universal width of alternating finite automata
- Fuzzy alternating automata over distributive lattices
- Descriptional complexity of regular languages
- Distributed XML design
- The ranges of accepting state complexities of languages resulting from some operations
- Title not available (Why is that?)
- Implementing automata. Selected papers from the 2nd international workshop, WIA '97, Univ. of Western Ontario, London, Ontario, Canada, September 18--20, 1997
This page was built for publication: Constructions for alternating finite automata∗
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3477972)
