JavaScript is disabled for your browser. Some features of this site may not work without it.
UWSpace will be migrating to a new version of its software from July 29th to August 1st. UWSpace will be offline for all UW community members during this time.
Brzozowski, Janusz; Jirásková, Galina; Baiyu, Li; Smith, Joshua(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", ...