Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
From MaRDI portal
Recommendations
- Operational state complexity of prefix-free regular languages
- State Complexity of Basic Operations on Suffix-Free Regular Languages
- State complexity of basic operations on suffix-free regular languages
- State Complexity of Combined Operations for Prefix-Free Regular Languages
- Nondeterministic state complexity for suffix-free regular languages
- State complexity of basic operations on non-returning regular languages
- State complexity of basic operations on non-returning regular languages
- The state complexities of some basic operations on regular languages
- State complexity of boundary of prefix-free regular languages
- State complexity of combined operations for suffix-free regular languages
Cited in
(34)- The state complexities of some basic operations on regular languages
- Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language \(R \) with \(R_{1}\subseteq R\subseteq R_{2}\) for given regular languages \(R_{1},R_{2}\).
- Power, positive closure, and quotients on convex languages
- Descriptional complexity of regular languages
- Operations on subregular languages and nondeterministic state complexity
- Nondeterministic complexity in subclasses of convex languages
- State complexity of unambiguous operations on finite automata
- State complexity of permutation on finite languages over a binary alphabet
- Networks of evolutionary processors: the power of subregular filters
- Nondeterministic complexity of operations on free and convex languages
- Non-regular Maximal Prefix-Free Subsets of Regular Languages
- Nondeterministic complexity of operations on closed and ideal languages
- Kuratowski algebras generated by prefix-free languages
- Nondeterministic state complexity of proportional removals
- State Complexity of Combined Operations for Prefix-Free Regular Languages
- Operational state complexity of prefix-free regular languages
- scientific article; zbMATH DE number 176770 (Why is no real title available?)
- scientific article; zbMATH DE number 1962776 (Why is no real title available?)
- Nondeterministic state complexity of star-free languages
- On external contextual grammars with subregular selection languages
- scientific article; zbMATH DE number 6855103 (Why is no real title available?)
- Nondeterministic state complexity for suffix-free regular languages
- Operations on automata with all states final
- Nondeterministic state complexity of positional addition
- Nondeterministic state complexity of proportional removals
- Nondeterministic state complexity of star-free languages
- State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
- Complement on prefix-free, suffix-free, and non-returning NFA languages
- Prefix-free subsets of regular languages and descriptional complexity
- Star-complement-star on prefix-free languages
- Nondeterministic operational complexity in subregular languages
- A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity
- The nondeterministic state complexity of the site-directed deletion language operation
- Prefix-free languages: left and right quotient and reversal
This page was built for publication: Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3625777)
