On partitions separating words
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10105133" target="_blank" >RIV/00216208:11320/11:10105133 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1142/S0218196711006650" target="_blank" >http://dx.doi.org/10.1142/S0218196711006650</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1142/S0218196711006650" target="_blank" >10.1142/S0218196711006650</a>
Alternative languages
Result language
angličtina
Original language name
On partitions separating words
Original language description
The paper studies separating two words by closed languages. It shows that two noncommuting words can be separated by a closed partition into regular languages.
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
2011
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
International Journal of Algebra and Computation
ISSN
0218-1967
e-ISSN
—
Volume of the periodical
21
Issue of the periodical within the volume
8
Country of publishing house
SG - SINGAPORE
Number of pages
12
Pages from-to
1305-1316
UT code for WoS article
—
EID of the result in the Scopus database
—