State complexity of unambiguous operations on finite automata
From MaRDI portal
Publication:2334604
DOI10.1016/J.TCS.2019.04.008zbMATH Open1435.68170OpenAlexW2946585142WikidataQ127816687 ScholiaQ127816687MaRDI QIDQ2334604FDOQ2334604
Authors: Galina Jirásková, Alexander Okhotin 
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
Recommendations
Cites Work
- The state complexities of some basic operations on regular languages
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- A lower bound technique for the size of nondeterministic finite automata
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- Operational state complexity of prefix-free regular languages
- Orthogonal concatenation: language equations and state complexity
- State complexity of power
- State complexity of basic operations on suffix-free regular languages
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- Title not available (Why is that?)
- The state complexity of \(L^{2}\) and \(L^k\)
- Unambiguous finite automata over a unary alphabet
- Partial orders on words, minimal elements of regular languages, and state complexity
- State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
- Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
- State complexity of operations on two-way finite automata over a unary alphabet
- Nondeterministic state complexity for suffix-free regular languages
- Title not available (Why is that?)
- On the state complexity of operations on two-way finite automata
- Formal languages over GF(2)
- State complexity of unique rational operations
- A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton
- Operations on Unambiguous Finite Automata
Cited In (25)
- State complexity of GF(2)-operations on unary languages
- Title not available (Why is that?)
- Operations on Unambiguous Finite Automata
- Operational accepting state complexity: the unary and finite case
- Some results on the structure of unary unambiguous automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- State complexity of operations on two-way finite automata over a unary alphabet
- Operational State Complexity under Parikh Equivalence
- Operations on Unambiguous Finite Automata
- Tight bounds for cut-operations on deterministic finite automata
- State complexity of unique rational operations
- On the number of active states in finite automata
- Title not available (Why is that?)
- State-complexity hierarchies of uniform languages of alphabet-size length
- STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET
- Operational state complexity of nested word automata
- State complexity of reversals of deterministic finite automata with output
- Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
- Finite automata with undirected state graphs
- State complexity of unambiguous operations on deterministic finite automata
- Initial-state detectability and initial-state opacity of unambiguous weighted automata
- Formal languages over GF(2)
- Nondeterministic state complexity of positional addition
- State-complexity of finite-state devices, state compressibility and incompressibility
This page was built for publication: State complexity of unambiguous operations on finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334604)
