Bertrand numeration systems and recognizability

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.181, Iss.1, 1997-07, pp. : 17-43

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Numeration systems on a regular language: arithmetic operations, recognizability and formal power series

By Rigo M.

Theoretical Computer Science, Vol. 269, Iss. 1, 2001-10 ,pp. : 469-498

Elsevier

Access to resources Recommend Favorite

A property of left-linear rewrite systems preserving recognizability

By Gyenizse P. Vagvolgyi S.

Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. : 477-498

Elsevier

Access to resources Recommend Favorite

Linear generalized semi-monadic rewrite systems effectively preserve recognizability

By Gyenizse P. Vagvolgyi S.

Theoretical Computer Science, Vol. 194, Iss. 1, 1998-03 ,pp. : 87-122

Elsevier

Access to resources Recommend Favorite

Uniform and nonuniform recognizability

By Thomas W.

Theoretical Computer Science, Vol. 292, Iss. 1, 2003-01 ,pp. : 299-316

Elsevier

Access to resources Recommend Favorite

Substitutions et -systemes de numeration

By Fabre S.

Theoretical Computer Science, Vol. 137, Iss. 2, 1995-01 ,pp. : 219-236

Elsevier

Access to resources Recommend Favorite