AbstractThe subword complexity of a language K is the function which to every positive integer n assigns the number of different subwords of length n occuring in words of K. A language K is square-free if no word in it contains a subword of the form xx where x is a nonempty word. The (best) upper and lower bounds on the subword complexity of infinite square-free DOL languages are established
The subword complexity function pw of a finite word w over a finite alphabet A with cardA = q ≥ 1 is...
AbstractRecently Clark and Eyraud (2007) [10] have shown that substitutable context-free languages, ...
AbstractThe syntactic complexity of a regular language is the cardinality of its syntactic semigroup...
AbstractThe subword complexity of a language K is the function which to every positive integer n ass...
this paper, it is shown that the subword complexity of a D0L language is bounded by cn (resp. cn ...
International audienceIn this paper we explore a new hierarchy of classes of languages and infinite ...
International audienceLet A * denote the free monoid generated by a finite nonempty set A. For each ...
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. S...
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 the investigation of the theory of grammatical complexity as started by Bucher...
AbstractWe present a new fast algorithm for calculating the growth rate of complexity for regular la...
A language K ⊆ Σ* is repetitive if for each positive integer n there exists a word w ∈ Σ+ such that ...
Abstract. A language L is prefix-closed if, whenever a word w is in L, then every prefix of w is als...
The tape complexity of context-free languages is investigated. It is shown that all the members of t...
AbstractIn this note we answer an open question in the theory of grammatical complexity: We show tha...
The subword complexity function pw of a finite word w over a finite alphabet A with cardA = q ≥ 1 is...
AbstractRecently Clark and Eyraud (2007) [10] have shown that substitutable context-free languages, ...
AbstractThe syntactic complexity of a regular language is the cardinality of its syntactic semigroup...
AbstractThe subword complexity of a language K is the function which to every positive integer n ass...
this paper, it is shown that the subword complexity of a D0L language is bounded by cn (resp. cn ...
International audienceIn this paper we explore a new hierarchy of classes of languages and infinite ...
International audienceLet A * denote the free monoid generated by a finite nonempty set A. For each ...
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. S...
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 the investigation of the theory of grammatical complexity as started by Bucher...
AbstractWe present a new fast algorithm for calculating the growth rate of complexity for regular la...
A language K ⊆ Σ* is repetitive if for each positive integer n there exists a word w ∈ Σ+ such that ...
Abstract. A language L is prefix-closed if, whenever a word w is in L, then every prefix of w is als...
The tape complexity of context-free languages is investigated. It is shown that all the members of t...
AbstractIn this note we answer an open question in the theory of grammatical complexity: We show tha...
The subword complexity function pw of a finite word w over a finite alphabet A with cardA = q ≥ 1 is...
AbstractRecently Clark and Eyraud (2007) [10] have shown that substitutable context-free languages, ...
AbstractThe syntactic complexity of a regular language is the cardinality of its syntactic semigroup...
DOI
Add to ORKG