State complexity of unambiguous operations on finite automata
From MaRDI portal
Publication:2334604
DOI10.1016/j.tcs.2019.04.008zbMath1435.68170OpenAlexW2946585142WikidataQ127816687 ScholiaQ127816687MaRDI QIDQ2334604
Alexander Okhotin, Galina Jirásková
Publication date: 7 November 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.04.008
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unambiguous finite automata over a unary alphabet
- State complexity of operations on two-way finite automata over a unary alphabet
- On the state complexity of operations on two-way finite automata
- A lower bound technique for the size of nondeterministic finite automata
- Partial orders on words, minimal elements of regular languages, and state complexity
- The state complexity of \(L^{2}\) and \(L^k\)
- State complexity of power
- State complexity of unique rational operations
- State complexity of basic operations on suffix-free regular languages
- The state complexities of some basic operations on regular languages
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
- Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
- Operations on Unambiguous Finite Automata
- A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- Formal languages over GF(2)
