Polynomial-time algorithm for fixed points of nontrivial morphisms
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A00206942" target="_blank" >RIV/00216208:11320/09:00206942 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Polynomial-time algorithm for fixed points of nontrivial morphisms
Original language description
The paper presents the first polynomial algorithm deciding whether a given finite word is a fixed point of a nontrivial morphism. The algorithm also constructs the corresponding morphism, which has the smallest possible number of non-erased letters.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
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
Discrete Mathematics
ISSN
0012-365X
e-ISSN
—
Volume of the periodical
2009
Issue of the periodical within the volume
309
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
8
Pages from-to
—
UT code for WoS article
000269476700014
EID of the result in the Scopus database
—