Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T06:29:35.703Z Has data issue: false hasContentIssue false

Codes générateurs minimaux de langagesde mots bi-infinis

Published online by Cambridge University Press:  15 April 2002

Jeanne Devolder*
Affiliation:
Laboratoire de Statistique et Probabilités, F.R.E. CNRS 2222, Université des Sciences et Technologies de Lille, bâtiment M2, 59655 Villeneuve-d'Ascq, France ; (Jeanne.Devolder@univ-lille1.fr)
Get access

Abstract

In this paper we give two families of codes which are minimal generators ofbiinfinite languages: the family of very thin codes (which contains the rationalcodes) and another family containing the circular codes. We propose the conjecture that all codes are minimal generators.

Information

Type
Research Article
Copyright
© EDP Sciences, 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable