An algorithm for enumerating all infinite repetitions in a D0L-system
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F15%3A00230663" target="_blank" >RIV/68407700:21240/15:00230663 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.jda.2015.03.006" target="_blank" >http://dx.doi.org/10.1016/j.jda.2015.03.006</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jda.2015.03.006" target="_blank" >10.1016/j.jda.2015.03.006</a>
Alternative languages
Result language
angličtina
Original language name
An algorithm for enumerating all infinite repetitions in a D0L-system
Original language description
We describe a simple algorithm that finds all primitive words v such that v^k is a factor of the language of a given D0L-system for all k. It follows that the number of such words is finite. This polynomial-time algorithm can be also used to decide whether a D0L-system is repetitive.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GP13-35273P" target="_blank" >GP13-35273P: Algorithms for circular morphisms and their fixed points</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Discrete Algorithms
ISSN
1570-8667
e-ISSN
—
Volume of the periodical
33
Issue of the periodical within the volume
—
Country of publishing house
DE - GERMANY
Number of pages
9
Pages from-to
130-138
UT code for WoS article
000358520400013
EID of the result in the Scopus database
2-s2.0-84930762466