AN ALGEBRAIC CHARACTERIZATION OF PREFIX-STRICT LANGUAGES

An Algebraic Characterization of Prefix-Strict Languages

An Algebraic Characterization of Prefix-Strict Languages

Blog Article

Let Σ+ be the set of all finite words over a finite alphabet Σ.A word u is called a strict prefix of Seat Protectors 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, if for any u,vL, u is a subword of v always implies that u is a strict prefix of v.Denote the class of all prefix-strict languages in Σ+ by P(Σ+).

This paper characterizes P(Σ+) as a universe of a model of the free object for the ai-semiring variety satisfying the additional identities x+yxx and x+yxzx.Furthermore, the Safety and Grab Bars analogous results for so-called suffix-strict languages and infix-strict languages are introduced.

Report this page