The following pages link to (Q3655366):
Displaying 18 items.
- Shuffled languages -- representation and recognition (Q388107) (← links)
- State complexity of combined operations for suffix-free regular languages (Q392179) (← links)
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages (Q443735) (← links)
- Syntactic complexity of regular ideals (Q722210) (← links)
- Prefix-free languages: left and right quotient and reversal (Q896681) (← links)
- Quotient complexity of closed languages (Q1678754) (← links)
- Power, positive closure, and quotients on convex languages (Q2029485) (← 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)
- Kuratowski Algebras Generated by Prefix-Free Languages (Q2830215) (← links)
- STATE COMPLEXITY OF CODE OPERATORS (Q2909103) (← links)
- Kleene closure and state complexity (Q2956884) (← 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)
- Prefix-Free Subsets of Regular Languages and Descriptional Complexity (Q5500687) (← links)
- Star-Complement-Star on Prefix-Free Languages (Q5500696) (← links)
- The cut operation in subclasses of convex languages (Q6165559) (← links)
