Skip to main content Accessibility help
×
Home
Hostname: page-component-768ffcd9cc-6vg6l Total loading time: 0.218 Render date: 2022-12-06T20:22:00.375Z Has data issue: true Feature Flags: { "useRatesEcommerce": false } hasContentIssue true

Uniformly bounded duplication codes

Published online by Cambridge University Press:  17 August 2007

Peter Leupold
Affiliation:
Research Group in Mathematical Linguistics, Rovira i Virgili University, Pça. Imperial Tàrraco 1, 43005 Tarragona, Catalunya, Spain; klauspeter.leupold@urv.cat; victor.mitrana1@urv.cat
Victor Mitrana
Affiliation:
Research Group in Mathematical Linguistics, Rovira i Virgili University, Pça. Imperial Tàrraco 1, 43005 Tarragona, Catalunya, Spain; klauspeter.leupold@urv.cat; victor.mitrana1@urv.cat Faculty of Mathematics and Computer Science, Bucharest University, Str. Academiei 14, 70109 Bucureşti, Romania.
Get access

Abstract

Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing duplications, one can eventually reach a square-free word, the original word's duplication root. The duplication root is unique, if the length of duplications is fixed. Based on these unique roots we define the concept of duplication code. Elementary properties are stated, then the conditions under which infinite duplication codes exist are fully characterized; the relevant parameters are the duplication length and alphabet size. Finally, some properties of the languages generated by duplication codes are investigated.

Type
Research Article
Copyright
© EDP Sciences, 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

J. Berstel and D. Perrin, Theory of Codes. Academic Press, Orlando (1985).
Dassow, J., Mitrana, V. and Păun, Gh., On the Regularity of Duplication Closure. Bull. EATCS 69 (1999) 133136.
Fine, N. and Wilf, H., Uniqueness Theorems for Periodic Functions. Proc. Amer. Math. Soc. 16 (1965) 109114. CrossRef
International Human Genome Sequencing Consortium, Finishing, the Euchromatic Sequence of the Human Genome. Nature 431 (2004) 931945.
Leupold, P., Mitrana, V. and Sempere, J., Languages Arising from Gene Repeated Duplication, in Aspects of Molecular Computing. Essays Dedicated to Tom Head on the Occasion of his 70th Birthday. Lect. Notes Comput. Sci. 2950 (2004) 297308. CrossRef
Leupold, P., Martín Vide, C. and Mitrana, V., Uniformly Bounded Duplication Languages. Discrete Appl. Math. 146 (2005) 301310. CrossRef
M. Lothaire, Combinatorics on Words. Addison-Wesley, Reading, MA (1983).
Ross, R. and Winklmann, K., Repetitive Strings are not Context-Free. RAIRO-Theor. Inf. Appl. 16 (1982) 191199.
A. Salomaa, Formal Languages. Academic Press, Orlando (1973).
H.J. Shyr, Free Monoids and Languages. Hon Min Book Company, Taichung (1991).
Wang, M.-W., On the Irregularity of the Duplication Closure. Bull. EATCS 70 (2000) 162163.

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Uniformly bounded duplication codes
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Uniformly bounded duplication codes
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Uniformly bounded duplication codes
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *