Arithmetical complexity of symmetric D0L words-Reference-Cited by-同舟云学术

Arithmetical complexity of symmetric D0L words

Published:2003-09 Issue:1-3 Volume:306 Page:535-542
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Frid A.E.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference15 articles.

1. Automatic Sequences: Theory, Applications, Generalizations;Allouche,2003

2. S.V. Avgustinovich, D.G. Fon-Der-Flaass, A.E. Frid, Arithmetical complexity of infinite words, in: Proc. 3rd Internat. Colloq. on Words, Languages and Combinatorics, World Scientific, Singapore, to be published.

3. J. Cassaigne, An algorithm to test if a given circular HD0L-language avoids a pattern, in: Information Processing’94, Vol. 1, North-Holland, Amsterdam, 1994, pp. 459–464.

4. Subword complexities of various classes of deterministic developmental languages without interaction;Ehrenfeucht;Theoret. Comput. Sci.,1975

5. Complexity of sequences and dynamical systems;Ferenczi;Discrete Math.,1999

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Monochromatic arithmetic progressions in automatic sequences with group structure;Journal of Combinatorial Theory, Series A;2024-04

2. Monochromatic arithmetic progressions in binary Thue–Morse-like words;Theoretical Computer Science;2022-10

3. The complexity of DNA sequences. Different approaches and definitions;Mathematical Biology and Bioinformatics;2020-11-30

4. On Arithmetic Progressions in the Generalized Thue-Morse Word;Lecture Notes in Computer Science;2015

5. Subword complexity of uniform D0L words over finite groups;Theoretical Computer Science;2011-09