On almost periodicity criteria for morphic sequences in some particular cases

Yuri Pritykin

doi:10.1007/978-3-540-73208-2_34

On almost periodicity criteria for morphic sequences in some particular cases

Yuri Pritykin

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Scopus citations

Abstract

In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm solving the problem is found. A result more or less supporting the conjecture of decidability of the general problem is given.

Original language	English (US)
Title of host publication	Developments in Language Theory - 11th International Conference, DLT 2007 Proceedings
Publisher	Springer Verlag
Pages	361-370
Number of pages	10
ISBN (Print)	3540732071, 9783540732075
DOIs	https://doi.org/10.1007/978-3-540-73208-2_34
State	Published - 2007
Externally published	Yes
Event	11th International Conference on Developments in Language Theory, DLT 2007 - Turku, Finland Duration: Jul 3 2007 → Jul 6 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4588 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	11th International Conference on Developments in Language Theory, DLT 2007
Country/Territory	Finland
City	Turku
Period	7/3/07 → 7/6/07

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-73208-2_34

Cite this

Pritykin, Y. (2007). On almost periodicity criteria for morphic sequences in some particular cases. In Developments in Language Theory - 11th International Conference, DLT 2007 Proceedings (pp. 361-370). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4588 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-73208-2_34

@inproceedings{d664f7151ac542d89bf6ce3acbc7b7ea,

title = "On almost periodicity criteria for morphic sequences in some particular cases",

abstract = "In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm solving the problem is found. A result more or less supporting the conjecture of decidability of the general problem is given.",

author = "Yuri Pritykin",

year = "2007",

doi = "10.1007/978-3-540-73208-2_34",

language = "English (US)",

isbn = "3540732071",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "361--370",

booktitle = "Developments in Language Theory - 11th International Conference, DLT 2007 Proceedings",

address = "Germany",

note = "11th International Conference on Developments in Language Theory, DLT 2007 ; Conference date: 03-07-2007 Through 06-07-2007",

}

Pritykin, Y 2007, On almost periodicity criteria for morphic sequences in some particular cases. in Developments in Language Theory - 11th International Conference, DLT 2007 Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4588 LNCS, Springer Verlag, pp. 361-370, 11th International Conference on Developments in Language Theory, DLT 2007, Turku, Finland, 7/3/07. https://doi.org/10.1007/978-3-540-73208-2_34

On almost periodicity criteria for morphic sequences in some particular cases. / Pritykin, Yuri.
Developments in Language Theory - 11th International Conference, DLT 2007 Proceedings. Springer Verlag, 2007. p. 361-370 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4588 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - On almost periodicity criteria for morphic sequences in some particular cases

AU - Pritykin, Yuri

PY - 2007

Y1 - 2007

N2 - In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm solving the problem is found. A result more or less supporting the conjecture of decidability of the general problem is given.

AB - In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm solving the problem is found. A result more or less supporting the conjecture of decidability of the general problem is given.

UR - http://www.scopus.com/inward/record.url?scp=34548101194&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34548101194&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-73208-2_34

DO - 10.1007/978-3-540-73208-2_34

M3 - Conference contribution

AN - SCOPUS:34548101194

SN - 3540732071

SN - 9783540732075

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 361

EP - 370

BT - Developments in Language Theory - 11th International Conference, DLT 2007 Proceedings

PB - Springer Verlag

T2 - 11th International Conference on Developments in Language Theory, DLT 2007

Y2 - 3 July 2007 through 6 July 2007

ER -

Pritykin Y. On almost periodicity criteria for morphic sequences in some particular cases. In Developments in Language Theory - 11th International Conference, DLT 2007 Proceedings. Springer Verlag. 2007. p. 361-370. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-73208-2_34

On almost periodicity criteria for morphic sequences in some particular cases

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this