No CrossRef data available.
Article contents
Codes générateurs minimaux de langages de mots bi-infinis
Published online by Cambridge University Press: 15 April 2002
Abstract
In this paper we give two families of codes which are minimal generators of biinfinite languages: the family of very thin codes (which contains the rational codes) and another family containing the circular codes. We propose the conjecture that all codes are minimal generators.
Keywords
- Type
- Research Article
- Information
- RAIRO - Theoretical Informatics and Applications , Volume 34 , Issue 6 , November 2000 , pp. 585 - 596
- Copyright
- © EDP Sciences, 2000
References
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20161010045652257-0678:S0988375400001326:S0988375400001326_eqnU1.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20161010045652257-0678:S0988375400001326:S0988375400001326_eqnU1.gif?pub-status=live)