The word problem for free adequate semigroups
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10317523" target="_blank" >RIV/00216208:11320/15:10317523 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1142/S0218196714500404" target="_blank" >http://dx.doi.org/10.1142/S0218196714500404</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1142/S0218196714500404" target="_blank" >10.1142/S0218196714500404</a>
Alternative languages
Result language
angličtina
Original language name
The word problem for free adequate semigroups
Original language description
We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time algorithms to solve the word problem and compute normal forms in each of these, and hence also to testwhether any given identity holds in the classes of left, right and/or two-sided adequate semigroups.
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
<a href="/en/project/GA13-01832S" target="_blank" >GA13-01832S: General algebra and its connections to computer science</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
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
International Journal of Algebra and Computation
ISSN
0218-1967
e-ISSN
—
Volume of the periodical
24
Issue of the periodical within the volume
6
Country of publishing house
US - UNITED STATES
Number of pages
15
Pages from-to
893-907
UT code for WoS article
—
EID of the result in the Scopus database
2-s2.0-84928535928