Pages that link to "Item:Q1706151"
From MaRDI portal
The following pages link to Syntactic complexity of suffix-free languages (Q1706151):
Displaying 4 items.
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages (Q443735) (← links)
- On syntactic complexity of circular semi-flower automata (Q1616987) (← links)
- Syntactic complexity of bifix-free regular languages (Q2319913) (← links)
- On nonpermutational transformation semigroups with an application to syntactic complexity (Q2820787) (← links)