Characterization of circular D0L-systems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F19%3A00332977" target="_blank" >RIV/68407700:21240/19:00332977 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.tcs.2019.04.021" target="_blank" >https://doi.org/10.1016/j.tcs.2019.04.021</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.tcs.2019.04.021" target="_blank" >10.1016/j.tcs.2019.04.021</a>

Result language
angličtina
Original language name
Characterization of circular D0L-systems
Original language description
We give a characterization of circularity of a D0L-system. The characterizing condition is simple to verify and yields an efficient algorithm. To derive it, we prove that every non-circular D0L-system contains arbitrarily long repetitions. This result was already published in 1993 by Mignosi and Séébold, however their proof is only a sketch. We give a complete proof that, in addition, is valid for a slightly relaxed definition of circularity, called weak circularity.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)