State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
From MaRDI portal
Recommendations
- STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES
- State Complexity of Union and Intersection of Finite Languages
- Intersection and union of regular languages and state complexity
- State complexity of operations on two-way deterministic finite automata over a unary alphabet
- State complexity of union and intersection on graph-walking automata
- State complexity of operations on two-way finite automata over a unary alphabet
- State complexity of k-union and k-intersection for prefix-free regular languages
- State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
- On the state complexity of operations on two-way finite automata
- On the State Complexity of Operations on Two-Way Finite Automata
Cited in
(9)- On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\)
- State complexity of union and intersection on graph-walking automata
- Performing regular operations with 1-limited automata
- State complexity of unambiguous operations on finite automata
- From two-way to one-way finite automata -- three regular expression-based methods
- State complexity of operations on two-way finite automata over a unary alphabet
- On the state complexity of operations on two-way finite automata
- State complexity of operations on two-way deterministic finite automata over a unary alphabet
- Performing regular operations with 1-limited automata
This page was built for publication: State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100939)
