Nondeterministic state complexity of star-free languages
From MaRDI portal
(Redirected from Publication:442152)
Recommendations
- Nondeterministic state complexity of star-free languages
- QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
- Quotient complexity of star-free languages
- Star-complement-star on prefix-free languages
- Syntactic complexities of six classes of star-free languages
- Square, power, positive closure, and complementation on star-free languages
- Nondeterministic state complexity for suffix-free regular languages
- Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
- Syntactic complexities of some classes of star-free languages
- State complexity of basic operations on suffix-free regular languages
Cites work
- scientific article; zbMATH DE number 3473324 (Why is no real title available?)
- scientific article; zbMATH DE number 1156489 (Why is no real title available?)
- scientific article; zbMATH DE number 1948495 (Why is no real title available?)
- scientific article; zbMATH DE number 1502111 (Why is no real title available?)
- scientific article; zbMATH DE number 7315105 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3269886 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- A lower bound technique for the size of nondeterministic finite automata
- Complexity in Union-Free Regular Languages
- Descriptional and computational complexity of finite automata -- a survey
- Descriptional complexity -- an introductory survey
- Determination of finite automata accepting subregular languages
- Finite automata and unary languages
- Intersection and union of regular languages and state complexity
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
- Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
- Nondeterministic state complexity for suffix-free regular languages
- On Decompositions of Regular Events
- On finite monoids having only trivial subgroups
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
- Optimal simulations between unary automata
- Power-separating regular languages
- Quotient complexity of bifix-, factor-, and subword-free regular languages
- Quotient complexity of regular languages
- Quotient complexity of star-free languages
- Roots of Star Events
- State complexity of regular languages
- State complexity of some operations on binary regular languages
- The magic number problem for subregular language families
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
Cited in
(14)- Nondeterminism growth and state complexity
- Operations on subregular languages and nondeterministic state complexity
- Expressive capacity of subregular expressions
- QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
- Concatenation-free languages
- Nondeterministic state complexity of star-free languages
- Closure properties of subregular languages under operations
- Nondeterministic complexity in subclasses of convex languages
- Operational state complexity of unary NFAs with finite nondeterminism
- Expressive capacity of concatenation freeness
- Nondeterministic operational complexity in subregular languages
- Square, power, positive closure, and complementation on star-free languages
- State complexity of unary language operations for NFAs with limited nondeterminism
- The nondeterministic state complexity of the site-directed deletion language operation
This page was built for publication: Nondeterministic state complexity of star-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442152)
