Descriptional Complexity of Operations on Alternating and Boolean Automata
From MaRDI portal
Recommendations
- Descriptional and Computational Complexity of Finite Automata
- Descriptional complexity of h-alternating finite automata
- Operations on Boolean and alternating finite automata
- Descriptional and computational complexity of the circuit representation of finite automata
- scientific article; zbMATH DE number 2068876
- Descriptional and computational complexity of finite automata -- a survey
- Descriptional Complexity of Nondeterministic Finite Automata
- Descriptional complexity of limited automata
- Descriptional complexity of input-driven pushdown automata
- On the descriptional complexity of the direct product of finite automata
Cited in
(14)- Operations on Boolean and alternating finite automata
- Alternation in two-way finite automata
- Descriptional complexity of regular languages
- Constructions for alternating finite automata∗
- scientific article; zbMATH DE number 1452984 (Why is no real title available?)
- Square on Deterministic, Alternating, and Boolean Finite Automata
- The complexity of concatenation on deterministic and alternating finite automata
- Descriptional complexity of the forever operator
- Converting finite width AFAs to nondeterministic and universal finite automata
- Operations on Boolean and Alternating Finite Automata
- Operational complexity: NFA-to-DFA trade-off
- Complexity of exclusive nondeterministic finite automata
- Conversions between six models of finite automata
- Alternating finite automata with limited universal branching
This page was built for publication: Descriptional Complexity of Operations on Alternating and Boolean Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907501)
