Viennot factorization of infinite words

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.

Proceed

Download / Buy Article:

Keywords: Combinatorial problems; Formal languages

Document Type: Research Article

DOI: http://dx.doi.org/10.1016/S0020-0190(96)00147-0

Affiliations: LaBRI, URA 1304 CNRS, Universite Bordeaux I, 351 Cours de la liberation, 33405 Talence Cedex, France

Publication date: October 28, 1996

Related content

Tools

Favourites

Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more