Scholarly Works

Binary self-adding sequences and languages

Journal article

Binary self-adding sequences and languages

Abstract

We inroduce the self-adding sequences, the binary case, and their associated languages. These languages are neither context-free nor DOL languages, but the inclusion (implicitly, the equivalence) problem is decidable, as well as other problems. Results concerning the periodicity of the self-adding sequences are also presented.

Authors

Ilie L; Mitrana V

Journal

International Journal of Computer Mathematics, Vol. 62, No. 3-4, pp. 171–181

Publisher

Taylor & Francis

Publication Date

January 1, 1996

DOI

10.1080/00207169608804535

ISSN

0020-7160

Associated Experts

Lucian Ilie

Adjunct Professor, Faculty of Engineering

Labels

Fields of Research (FoR)

46 Information and Computing Sciences 4904 Pure Mathematics 49 Mathematical Sciences 4603 Computer vision and multimedia computation 4901 Applied mathematics

View published work (Non-McMaster Users)

View published work (McMaster Users)

Contact the Experts team

Get technical help

or

Provide website feedback