Pages that link to "Item:Q1029324"

The following pages link to State complexity of basic operations on suffix-free regular languages (Q1029324):

Displaying 32 items.

• State complexity of combined operations for suffix-free regular languages (Q392179) (← links)
• Nondeterministic state complexity of star-free languages (Q442152) (← links)
• Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages (Q443735) (← links)
• On external contextual grammars with subregular selection languages (Q443738) (← links)
• Syntactic complexity of regular ideals (Q722210) (← links)
• Quotient complexity of closed languages (Q1678754) (← links)
• Syntactic complexity of suffix-free languages (Q1706151) (← links)
• Power, positive closure, and quotients on convex languages (Q2029485) (← links)
• Descriptional complexity of regular languages (Q2074214) (← links)
• Closure properties of subregular languages under operations (Q2104140) (← links)
• The cut operation in subclasses of convex languages (extended abstract) (Q2164745) (← links)
• State complexity of unambiguous operations on finite automata (Q2334604) (← links)
• Networks of evolutionary processors: the power of subregular filters (Q2376983) (← links)
• Complexity of suffix-free regular languages (Q2402364) (← links)
• COMPLEXITY IN UNION-FREE REGULAR LANGUAGES (Q2909101) (← links)
• STATE COMPLEXITY OF CODE OPERATORS (Q2909103) (← links)
• THE MAGIC NUMBER PROBLEM FOR SUBREGULAR LANGUAGE FAMILIES (Q2909186) (← links)
• Complexity of Suffix-Free Regular Languages (Q2947876) (← links)
• State Complexity of Insertion (Q2970209) (← links)
• State Complexity of Catenation Combined with Union and Intersection (Q3073626) (← links)
• STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION (Q3224949) (← links)
• State Complexity of Boundary of Prefix-Free Regular Languages (Q3455750) (← links)
• QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES (Q4923279) (← links)
• Operations on Permutation Automata (Q5041254) (← links)
• Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages (Q5200084) (← links)
• Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation (Q5205044) (← links)
• State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages (Q5261608) (← links)
• Operational State Complexity of Subtree-Free Regular Tree Languages (Q5298309) (← links)
• Upper Bound on Syntactic Complexity of Suffix-Free Languages (Q5500677) (← links)
• Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages (Q5738995) (← links)
• State complexity of deletion and bipolar deletion (Q5963404) (← links)
• The cut operation in subclasses of convex languages (Q6165559) (← links)