Operations on Unambiguous Finite Automata
From MaRDI portal
Publication:2817392
DOI10.1007/978-3-662-53132-7_20zbMath1436.68176OpenAlexW2484436671WikidataQ57380772 ScholiaQ57380772MaRDI QIDQ2817392
Jozef jun. Jirásek, Galina Jirásková, Juraj Šebej
Publication date: 30 August 2016
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53132-7_20
Related Items (4)
State complexity of operations on input-driven pushdown automata ⋮ A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton ⋮ On the state complexity of operations on two-way finite automata ⋮ On degrees of ambiguity for Büchi tree automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unambiguous finite automata over a unary alphabet
- Ambiguity and communication
- A lower bound technique for the size of nondeterministic finite automata
- Partial orders on words, minimal elements of regular languages, and state complexity
- Succinct representation of regular languages by Boolean automata
- On the finite-valuedness problem for sequential machines
- On the degree of ambiguity of finite automata
- The state complexities of some basic operations on regular languages
- State complexity of some operations on binary regular languages
- Communication complexity method for measuring nondeterminism in finite automata
- Kleene Star on Unary Regular Languages
- GENERAL ALGORITHMS FOR TESTING THE AMBIGUITY OF FINITE AUTOMATA AND THE DOUBLE-TAPE AMBIGUITY OF FINITE-STATE TRANSDUCERS
- Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
- Unambiguity in Automata Theory
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
This page was built for publication: Operations on Unambiguous Finite Automata
