Power, positive closure, and quotients on convex languages
From MaRDI portal
Publication:2029485
Recommendations
- Descriptional complexity of power and positive closure on convex languages
- Nondeterministic complexity in subclasses of convex languages
- Nondeterministic complexity of operations on free and convex languages
- Nondeterministic complexity of operations on closed and ideal languages
- Complexity of right-ideal, prefix-closed, and prefix-free regular languages
Cites work
- A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity
- Complement on free and ideal languages
- Complement on prefix-free, suffix-free, and non-returning NFA languages
- Complexity in convex languages
- Complexity in union-free regular languages
- Complexity of proper prefix-convex regular languages
- Complexity of proper suffix-convex regular languages
- Descriptional complexity of power and positive closure on convex languages
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 2081044 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3353192 (Why is no real title available?)
- INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
- Intersection and union of regular languages and state complexity
- Kleene Closure on Regular and Prefix-Free Languages
- NFA-to-DFA trade-off for regular operations
- Nondeterministic complexity in subclasses of convex languages
- Nondeterministic complexity of operations on closed and ideal languages
- Nondeterministic complexity of operations on free and convex languages
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- Nondeterministic state complexity for suffix-free regular languages
- Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
- Operational state complexity of prefix-free regular languages
- Operations on automata with all states final
- Prefix-free languages: left and right quotient and reversal
- Quotient complexity of bifix-, factor-, and subword-free regular languages
- Quotient complexity of ideal languages
- Reversal of binary regular languages
- Square on ideal, closed and free languages
- State complexity of basic operations on suffix-free regular languages
- The state complexities of some basic operations on regular languages
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
Cited in
(12)- Closure properties of subregular languages under operations
- Operations on subregular languages and nondeterministic state complexity
- Descriptional complexity of power and positive closure on convex languages
- Distinguishability operations and closures
- Complexity of right-ideal, prefix-closed, and prefix-free regular languages
- On the state complexity of closures and interiors of regular languages with subwords
- Nondeterministic operational complexity in subregular languages
- Operations on Boolean and Alternating Finite Automata
- On discrete properties of Bernoulli shift
- Operational complexity: NFA-to-DFA trade-off
- Closure properties of subregular languages under operations
- Conversions between six models of finite automata
This page was built for publication: Power, positive closure, and quotients on convex languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029485)
