Operations on Unambiguous Finite Automata
From MaRDI portal
Recommendations
- Operations on Unambiguous Finite Automata
- Operations on Self-Verifying Finite Automata
- Operations on Boolean and alternating finite automata
- State complexity of unambiguous operations on finite automata
- scientific article; zbMATH DE number 4094825
- Unambiguous automata
- Unambiguous finite automata over a unary alphabet
- Unambiguous finite automata over a unary alphabet
- State complexity of unambiguous operations on deterministic finite automata
Cites work
- A lower bound technique for the size of nondeterministic finite automata
- Ambiguity and communication
- Communication complexity method for measuring nondeterminism in finite automata
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
- General algorithms for testing the ambiguity of finite automata and the double-tape ambiguity of finite-state transducers
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 3978429 (Why is no real title available?)
- scientific article; zbMATH DE number 1916664 (Why is no real title available?)
- scientific article; zbMATH DE number 3269886 (Why is no real title available?)
- scientific article; zbMATH DE number 3353192 (Why is no real title available?)
- Kleene star on unary regular languages
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- On the degree of ambiguity of finite automata
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- On the finite-valuedness problem for sequential machines
- Partial orders on words, minimal elements of regular languages, and state complexity
- Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
- Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
- State complexity of some operations on binary regular languages
- Succinct representation of regular languages by Boolean automata
- The state complexities of some basic operations on regular languages
- Unambiguity in automata theory
- Unambiguous finite automata over a unary alphabet
Cited in
(21)- On degrees of ambiguity for Büchi tree automata
- Performing regular operations with 1-limited automata
- State complexity of unambiguous operations on finite automata
- State complexity of operations on input-driven pushdown automata
- On complementing unambiguous automata and graphs with many cliques and cocliques
- Operations on Self-Verifying Finite Automata
- Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
- Unambiguous finite automata over a unary alphabet
- scientific article; zbMATH DE number 4094825 (Why is no real title available?)
- Operations on Unambiguous Finite Automata
- scientific article; zbMATH DE number 1452989 (Why is no real title available?)
- 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
- \((k,l)\)-unambiguity and quasi-deterministic structures
- (k,l)-unambiguity and quasi-deterministic structures: an alternative for the determinization
- Finite Automata on Unranked and Unordered DAGs
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Unambiguous constrained automata
- Structurally Unambiguous Finite Automata
- Degrees of ambiguity for parity tree automata
- State complexity of unambiguous operations on deterministic finite automata
This page was built for publication: Operations on Unambiguous Finite Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817392)
