Constructions for alternating finite automata∗
From MaRDI portal
Publication:3477972
Recommendations
Cites work
- A note on alternating on-line Turing machines
- Alternating multicounter machines with constant number of reversals
- Alternating Pushdown and Stack Automata
- Alternation
- Alternation and -type Turing acceptors
- scientific article; zbMATH DE number 3936518 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 194974 (Why is no real title available?)
- On alternation
- On the power of alternation in automata theory
- Some observations concerning alternating Turing machines using small space
- Tree-size bounded alternation
Cited in
(33)- A construction on finite automata that has remained hidden
- The state complexities of some basic operations on regular languages
- From bidirectionality to alternation.
- Alternating finite automata and star-free languages
- Efficient implementation of regular languages using reversed alternating finite automata
- Implementing automata. Selected papers from the 2nd international workshop, WIA '97, Univ. of Western Ontario, London, Ontario, Canada, September 18--20, 1997
- Alternation in two-way finite automata
- Descriptional complexity of regular languages
- Method of Constructing Two-Way Alternating Automata for PSL and Translation to Nondeterministic Automata
- Descriptional and Computational Complexity of Finite Automata
- An alternating hierarchy for finite automata
- Domain mu-calculus
- scientific article; zbMATH DE number 1759428 (Why is no real title available?)
- scientific article; zbMATH DE number 1931697 (Why is no real title available?)
- scientific article; zbMATH DE number 3999320 (Why is no real title available?)
- Equations and regular-like expressions for afa
- Square on Deterministic, Alternating, and Boolean Finite Automata
- The complexity of concatenation on deterministic and alternating finite automata
- Descriptional complexity of the forever operator
- Alternation Elimination by Complementation (Extended Abstract)
- Descriptional and computational complexity of finite automata -- a survey
- Linear parsing expression grammars
- The ranges of accepting state complexities of languages resulting from some operations
- Existential and universal width of alternating finite automata
- Operations on Boolean and Alternating Finite Automata
- Reasoning About Regular Properties: A Comparative Study
- Distributed XML design
- Existential and universal width of alternating finite automata
- Complexity of exclusive nondeterministic finite automata
- Conversions between six models of finite automata
- Fuzzy alternating automata over distributive lattices
- Alternating finite automata on -words
- Construction of Aho Corasick automaton in linear time for integer alphabets
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)
