https://uwspace.uwaterloo.ca/items/25866d61-cfb1-4f9b-b8cf-74e4e720f263
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Language
A language $L$ is prefix-free if whenever words $u$ and $v$ are in $L$ and $u$ is a prefix of $v$, then $u=v$. Suffix-, factor-, and subword-free languages are...
quotientcomplexitybifixfactorfree
https://uwspace.uwaterloo.ca/items/ab0013c6-46e5-4a87-8a3f-695209b1afd6
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular...
complexityprefixsuffix