Bispecial factors in circular non-pushy D0L languages

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F12%3A00193288" target="_blank" >RIV/68407700:21240/12:00193288 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1016/j.tcs.2012.05.007" target="_blank" >http://dx.doi.org/10.1016/j.tcs.2012.05.007</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.tcs.2012.05.007" target="_blank" >10.1016/j.tcs.2012.05.007</a>

Result language

angličtina

Original language name

Bispecial factors in circular non-pushy D0L languages

Original language description

We study bispecial factors in fixed points of morphisms. In particular, we propose a simple method of finding all bispecial words of non-pushy circular D0L-systems. This method can be formulated as an algorithm. Moreover, we prove that non-pushy circularD0L-systems are exactly those with finite critical exponents.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2012

Confidentiality

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

Name of the periodical

Theoretical Computer Science

ISSN

0304-3975

e-ISSN

—

Volume of the periodical

445

Issue of the periodical within the volume

—

Country of publishing house

GB - UNITED KINGDOM

Number of pages

12

Pages from-to

63-74

UT code for WoS article

000306257500005

EID of the result in the Scopus database

—