Pages that link to "Item:Q5500687"
From MaRDI portal
The following pages link to Prefix-Free Subsets of Regular Languages and Descriptional Complexity (Q5500687):
Displaying 6 items.
- Prefix-free regular languages and pattern matching (Q2465647) (← links)
- Non-regular Maximal Prefix-Free Subsets of Regular Languages (Q2817391) (← links)
- Kleene Closure on Regular and Prefix-Free Languages (Q3192267) (← links)
- (Q4964027) (← links)
- Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation (Q5205044) (← links)
- Theoretical Aspects of Computing – ICTAC 2005 (Q5395094) (← links)