Now showing items 1-1 of 1
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Language
(Institute of Informatics: University of Szeged, 2014)
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 defined similarly, where by ``subword" we mean ``subsequence", ...