Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Elegant Structures in Computation. To Andrzej Ehrenfeucht on His 85th Birthday
Guest editors: Gheorghe Păun, Grzegorz Rozenberg and Arto Salomaa
Article type: Research Article
Authors: Honkala, Juha; *
Affiliations: Department of Mathematics and Statistics, University of Turku, FI-20014 Turku, Finland. [email protected]
Correspondence: [*] Address for correspondence: Department of Mathematics and Statistics, University of Turku, FI-20014 Turku, Finland
Abstract: We study D0L sequences and their equality sets. If s = (s(n))n≥0 and t = (t(n))n≥0 are D0L sequences, their equality set is defined by E(s, t) = {n ≥ 0 | s(n) = t(n)}. It is an open problem whether such equality sets are always eventually periodic. Using methods developed by Ehrenfeucht and Rozenberg we show that a D0L equality set is eventually periodic if it contains at least one infinite arithmetic progression. As a main tool we use elementary morphisms introduced by Ehrenfeucht and Rozenberg.
Keywords: D0L system, elementary morphism, D0L equality set, eventual periodicity
DOI: 10.3233/FI-2017-1561
Journal: Fundamenta Informaticae, vol. 154, no. 1-4, pp. 201-206, 2017
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]