Unary language operations and their nondeterministic state complexity
From MaRDI portal
Recommendations
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- State complexity of unary language operations for NFAs with limited nondeterminism
- State complexity of GF(2)-operations on unary languages
- scientific article; zbMATH DE number 6855103
- Unrestricted state complexity of binary operations on regular languages
- Operational state complexity of unary NFAs with finite nondeterminism
- Unary language concatenation and its state complexity
- State complexity of chop operations on unary and finite languages
- Operations on subregular languages and nondeterministic state complexity
- State complexity of unambiguous operations on finite automata
Cited in
(31)- State complexity of basic operations on suffix-free regular languages
- A general approach to state complexity of operations: formalization and limitations
- Descriptional complexity of limited automata
- On the descriptional complexity of finite automata with modified acceptance conditions
- State complexity of some operations on binary regular languages
- Complementing unary nondeterministic automata
- Finite transducers and nondeterministic state complexity of regular languages
- Usefulness of information and unary languages
- Estimation of state complexity of combined operations
- State complexity of combined operations
- Transition complexity of language operations
- Tight bounds for cut-operations on deterministic finite automata
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- Nondeterministic state complexity of star-free languages
- scientific article; zbMATH DE number 2050942 (Why is no real title available?)
- Unary language concatenation and its state complexity
- scientific article; zbMATH DE number 6855103 (Why is no real title available?)
- scientific article; zbMATH DE number 1869614 (Why is no real title available?)
- Operational accepting state complexity: the unary and finite case
- State complexity of unary language operations for NFAs with limited nondeterminism
- On simulation cost of unary limited automata
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case
- The nondeterministic state complexity of the site-directed deletion language operation
- Complexity of unary exclusive nondeterministic finite automata
- Languages given by finite automata over the unary alphabet
- Languages given by finite automata over the unary alphabet
- On the existence of prime decompositions
- Operational state complexity of unary NFAs with finite nondeterminism
- Deciding determinism of unary languages
- Lower bounds for the transition complexity of NFAs
This page was built for publication: Unary language operations and their nondeterministic state complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4412108)