A language is prefix-continuous if it satisfies the condition that, if a word w and its prefix u are in the language, then so is every prefix of w that has u as a prefix. Prefix-continuous languages include prefix-closed languages at one end of the spectrum, and prefix-free languages, which include prefix codes, at the other. In a similar way, we define suffix-, bifix-, factor-, and subword-continuous languages and their closed and free counterparts. We generalize these notions to arbitrary binary relations on Σ∗. This provides a common framework for diverse languages such as codes, factorial languages and ideals. We examine the relationships among these languages and their closure properties.
This article is a continuation of the work of the second author on the connections between the theor...
Abstract. We study a novel representation of semiautomata, which is motivated by the method of trace...
AbstractThis paper proposes three possible definitions of context-free languages over infinite alpha...
Abstract. A language L is prefix-closed if, whenever a word w is in L, then every prefix of w is als...
Let Σ+ be the set of all finite words over a finite alphabet Σ. A word u is called a strict prefix o...
Abstract A language L is prefix-closed if, whenever a word w is in L, then every prefix of w is also...
AbstractWe generalize the following two language- and automata-theoretic results to ω-continuous sem...
Abstract. A language L is prefix-convex if, whenever words u and w are in L with u a prefix of w, th...
Based on the general operation of words, called bw_operation, the notions of primitive words, close...
AbstractEach set of operations selected from union, intersection, complement, star, quotients, deriv...
Abstract: Based on the general operation ◦ of words, called bw-operation, the notions of ◦-primitive...
It is proposed that structural equivalence of phrase-structure languages be defined by means of intr...
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. ...
AbstractIn this paper we investigate languages containing at most a bounded number of words of each ...
AbstractThe syntactic complexity of a regular language is the cardinality of its syntactic semigroup...
This article is a continuation of the work of the second author on the connections between the theor...
Abstract. We study a novel representation of semiautomata, which is motivated by the method of trace...
AbstractThis paper proposes three possible definitions of context-free languages over infinite alpha...
Abstract. A language L is prefix-closed if, whenever a word w is in L, then every prefix of w is als...
Let Σ+ be the set of all finite words over a finite alphabet Σ. A word u is called a strict prefix o...
Abstract A language L is prefix-closed if, whenever a word w is in L, then every prefix of w is also...
AbstractWe generalize the following two language- and automata-theoretic results to ω-continuous sem...
Abstract. A language L is prefix-convex if, whenever words u and w are in L with u a prefix of w, th...
Based on the general operation of words, called bw_operation, the notions of primitive words, close...
AbstractEach set of operations selected from union, intersection, complement, star, quotients, deriv...
Abstract: Based on the general operation ◦ of words, called bw-operation, the notions of ◦-primitive...
It is proposed that structural equivalence of phrase-structure languages be defined by means of intr...
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. ...
AbstractIn this paper we investigate languages containing at most a bounded number of words of each ...
AbstractThe syntactic complexity of a regular language is the cardinality of its syntactic semigroup...
This article is a continuation of the work of the second author on the connections between the theor...
Abstract. We study a novel representation of semiautomata, which is motivated by the method of trace...
AbstractThis paper proposes three possible definitions of context-free languages over infinite alpha...
Add to ORKG