An Algebraic Characterization of Prefix-Strict Languages
Jing Tian, Yizhi Chen, Hui Xu • Mathematics
(2022)
Let Σ+ be the set of all finite words over a finite alphabet Σ. A word u is called a strict prefix of a word v, if u is a prefix of v and there is no other way to show that u is a subword of v. A language L⊆Σ+ is said to be prefix-strict, i...
DOAJ
Open Access (DOAJ)
DOI:
10.3390/math10193416