![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
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.
1Research supported by the Academy of Finland, project 11281, and by the Alexander Von Humboldt Foundation.
2Current address: Turku Centre for Computer Science (TUCS), Lemminkäisenkatu 14 A, 4th Floor, 20520 Turku, FINLAND.
3Current address: Faculty of Computer Science, University of Magdeburg P.O. Box 4120, D-39016, Magdeburg, GERMAMY.
1Research supported by the Academy of Finland, project 11281, and by the Alexander Von Humboldt Foundation.
2Current address: Turku Centre for Computer Science (TUCS), Lemminkäisenkatu 14 A, 4th Floor, 20520 Turku, FINLAND.
3Current address: Faculty of Computer Science, University of Magdeburg P.O. Box 4120, D-39016, Magdeburg, GERMAMY.
Notes
1Research supported by the Academy of Finland, project 11281, and by the Alexander Von Humboldt Foundation.
2Current address: Turku Centre for Computer Science (TUCS), Lemminkäisenkatu 14 A, 4th Floor, 20520 Turku, FINLAND.
3Current address: Faculty of Computer Science, University of Magdeburg P.O. Box 4120, D-39016, Magdeburg, GERMAMY.