State complexity of unambiguous operations on finite automata
From MaRDI portal
Publication:2334604
Recommendations
Cites work
- scientific article; zbMATH DE number 7315105 (Why is no real title available?)
- scientific article; zbMATH DE number 3353192 (Why is no real title available?)
- A lower bound technique for the size of nondeterministic finite automata
- A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton
- Formal languages over GF(2)
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
- Nondeterministic state complexity for suffix-free regular languages
- On the state complexity of operations on two-way finite automata
- Operational state complexity of prefix-free regular languages
- Operations on Unambiguous Finite Automata
- Orthogonal concatenation: language equations and state complexity
- Partial orders on words, minimal elements of regular languages, and state complexity
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
- State complexity of basic operations on suffix-free regular languages
- State complexity of operations on two-way finite automata over a unary alphabet
- State complexity of power
- State complexity of unique rational operations
- The state complexities of some basic operations on regular languages
- The state complexity of \(L^{2}\) and \(L^k\)
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- Unambiguous finite automata over a unary alphabet
Cited in
(26)- State-complexity of finite-state devices, state compressibility and incompressibility
- State complexity of GF(2)-operations on unary languages
- scientific article; zbMATH DE number 7315100 (Why is no real title available?)
- Operations on Unambiguous Finite Automata
- Some results on the structure of unary unambiguous automata
- Operational accepting state complexity: the unary and finite case
- scientific article; zbMATH DE number 1948495 (Why is no real title available?)
- State complexity of operations on two-way finite automata over a unary alphabet
- scientific article; zbMATH DE number 7770054 (Why is no real title available?)
- Operational State Complexity under Parikh Equivalence
- Operations on Unambiguous Finite Automata
- State complexity of unique rational operations
- Tight bounds for cut-operations on deterministic finite automata
- On the number of active states in finite automata
- scientific article; zbMATH DE number 6855103 (Why is no real title available?)
- State-complexity hierarchies of uniform languages of alphabet-size length
- Operational state complexity of nested word automata
- State complexity of reversals of deterministic finite automata with output
- STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET
- Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
- Finite automata with undirected state graphs
- 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
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)
