Semi-discrete context-free languages<sup>†</sup>

Latteux, Michel; Thierrin, Gabriel

doi:10.1080/00207168308803373

Cited by 23 publications

(29 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We recall that bounded context-free languages are exactly the context-free languages for which the number of words belonging to the language and of a given length n is bounded by a polynomial in n [10,11]. These languages are thus also known as sparse.…”

Section: Bounded Languagesmentioning

confidence: 98%

On the separability of sparse context-free languages and of bounded rational relations

Choffrut

D'Alessandro

Varricchio

2007

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

Section: Bounded Languagesmentioning

confidence: 98%

On the separability of sparse context-free languages and of bounded rational relations

Choffrut

D'Alessandro

Varricchio

2007

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…(15). Then there exist non-negative integers m and n 0 and a finite set of polynomials with rational coefficients p 0 , .…”

Section: Lemmamentioning

confidence: 98%

“…We recall that the family of sparse context-free languages coincides with the family of bounded context-free languages [15]. Moreover, bounded context-free languages and their properties have been extensively studied in [4], where, in particular, it is proved that it is decidable whether a given context-free language is bounded, so that it is also decidable whether a context-free language is sparse.…”

Section: Introductionmentioning

confidence: 99%

On the structure of the counting function of sparse context-free languages

D'Alessandro

Intrigila

Varricchio

2006

Theoretical Computer Science

View full text Add to dashboard Cite

We give an exact description of the counting function of a sparse context-free language. Let L be a sparse context-free language and let f(L) be its counting function. Then there exist polynomials p(0), P-1,..., Pk-1, with rational coefficients, and an integerconstant k(0), such that for any n >= k(0) one has f(L) (it) = p(j) (n) where j is such that j equivalent to n mod k. As a consequence one can easily show the decidability of some questions concerning sparse context-free languages. Finally, we show that for any sparse context-free language L there exists a regular language L' such that for any n >= 0 one has f(L) (n) = f(L') (it) and, therefore, f(L) is rational. (c) 2006 Elsevier B.V. All rights reserved

show abstract

“…A characterization concerning the language related to the case of h (uv + w) being regular is shown in [6] as follows:…”

Section: Lemma 11 (Chu and Town [1]) Letmentioning

confidence: 99%

Word-paired catenations of regular languages

Hsiao

Zhao

2004

Discrete Mathematics

View full text Add to dashboard Cite

In this paper, we mainly focus on the properties of word-paired catenations of regular languages and related languages. We propose a characterization of local regular languages from the viewpoint of word-paired catenation. We also investigate the properties of languages such that the word-paired catenations are regular-free. The languages, on condition that the word-paired catenations of these languages and their complements or reverses are regular, are studied too. (C) 2004 Elsevier B.V. All rights reserved

show abstract

Semi-discrete context-free languages^†

Cited by 23 publications

References 10 publications

On the separability of sparse context-free languages and of bounded rational relations

On the separability of sparse context-free languages and of bounded rational relations

On the structure of the counting function of sparse context-free languages

Word-paired catenations of regular languages

Contact Info

Product

Resources

About

Semi-discrete context-free languages†

Cited by 23 publications

References 10 publications

On the separability of sparse context-free languages and of bounded rational relations

On the separability of sparse context-free languages and of bounded rational relations

On the structure of the counting function of sparse context-free languages

Word-paired catenations of regular languages

Contact Info

Product

Resources

About

Semi-discrete context-free languages^†