Pages that link to "Item:Q3625777"

The following pages link to Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages (Q3625777):

Displaying 24 items.

• Nondeterministic state complexity of star-free languages (Q442152) (← links)
• On external contextual grammars with subregular selection languages (Q443738) (← links)
• Prefix-free languages: left and right quotient and reversal (Q896681) (← links)
• The state complexities of some basic operations on regular languages (Q1318694) (← links)
• 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}\). (Q1853563) (← links)
• Power, positive closure, and quotients on convex languages (Q2029485) (← links)
• Descriptional complexity of regular languages (Q2074214) (← links)
• Operations on subregular languages and nondeterministic state complexity (Q2112186) (← links)
• Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
• State complexity of unambiguous operations on finite automata (Q2334604) (← links)
• State complexity of permutation on finite languages over a binary alphabet (Q2358683) (← links)
• Networks of evolutionary processors: the power of subregular filters (Q2376983) (← links)
• Nondeterministic complexity of operations on free and convex languages (Q2399254) (← links)
• Non-regular Maximal Prefix-Free Subsets of Regular Languages (Q2817391) (← links)
• Nondeterministic Complexity of Operations on Closed and Ideal Languages (Q2830213) (← links)
• Kuratowski Algebras Generated by Prefix-Free Languages (Q2830215) (← links)
• (Q4036600) (← links)
• Nondeterministic State Complexity of Star-Free Languages (Q5200063) (← links)
• State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages (Q5261608) (← links)
• Prefix-Free Subsets of Regular Languages and Descriptional Complexity (Q5500687) (← links)
• Star-Complement-Star on Prefix-Free Languages (Q5500696) (← links)
• Nondeterministic operational complexity in subregular languages (Q6093571) (← links)
• A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity (Q6163615) (← links)
• The nondeterministic state complexity of the site-directed deletion language operation (Q6175008) (← links)