The following pages link to (Q5313790):
Displayed 14 items.
- Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
- Picture-hanging puzzles (Q489745) (← links)
- Detecting palindromes, patterns and borders in regular languages (Q1041028) (← links)
- The ring of \(k\)-regular sequences. II. (Q1426034) (← links)
- Expressive power and succinctness of the positive calculus of binary relations (Q2141281) (← links)
- Concatenation-free languages (Q2357107) (← links)
- Generating all permutations by context-free grammars in Chomsky normal form (Q2368945) (← links)
- Generating all permutations by context-free grammars in Greibach normal form (Q2378538) (← links)
- Transition complexity of language operations (Q2465047) (← links)
- State Complexity of Combined Operations for Prefix-Free Regular Languages (Q3618598) (← links)
- Implementation of State Elimination Using Heuristics (Q3637355) (← links)
- (Q5089218) (← links)
- Expressive Power and Succinctness of the Positive Calculus of Relations (Q5098722) (← links)
- Regular expression length via arithmetic formula complexity (Q5918469) (← links)