Pages that link to "Item:Q2909101"
From MaRDI portal
The following pages link to Complexity in union-free regular languages (Q2909101):
Displaying 22 items.
- On a structural property in the state complexity of projected regular languages (Q443744) (← links)
- On classes of tractable unrestricted regular expressions (Q1061498) (← links)
- On equations for union-free regular languages (Q1854402) (← links)
- Power, positive closure, and quotients on convex languages (Q2029485) (← links)
- Closure properties of subregular languages under operations (Q2104140) (← links)
- Operations on subregular languages and nondeterministic state complexity (Q2112186) (← links)
- Union-complexities of Kleene plus operation (Q2112193) (← links)
- Operational union-complexity (Q2113386) (← links)
- Union-freeness, deterministic union-freeness and union-complexity (Q2179325) (← links)
- Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
- Concatenation-free languages (Q2357107) (← links)
- Nondeterministic complexity of operations on free and convex languages (Q2399254) (← links)
- Nondeterministic Complexity of Operations on Closed and Ideal Languages (Q2830213) (← links)
- On Union-Free and Deterministic Union-Free Languages (Q2915169) (← links)
- Complexity in Union-Free Regular Languages (Q3584898) (← links)
- Operations on Permutation Automata (Q5041254) (← links)
- State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages (Q5261608) (← links)
- Descriptional Complexity of the Forever Operator (Q5384434) (← links)
- Languages, Decidability, and Complexity (Q5496920) (← 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)
- Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages (Q6169889) (← links)
