Reducibility vs. definability for pseudovarieties of semigroups

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F16%3A00088364" target="_blank" >RIV/00216224:14310/16:00088364 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1142/S0218196716500648" target="_blank" >http://dx.doi.org/10.1142/S0218196716500648</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1142/S0218196716500648" target="_blank" >10.1142/S0218196716500648</a>

Result language
angličtina
Original language name
Reducibility vs. definability for pseudovarieties of semigroups
Original language description
It is easy to show that a pseudovariety which is reducible with respect to an implicit signature sigma for the equation x=y can also be defined by sigma-identities. We present several negative examples for the converse using signatures in which the pseudovarieties are usually defined. An ordered example issue from the extended Straubing–Thérien hierarchy of regular languages is also shown to provide a positive example.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/GA15-02862S" target="_blank" >GA15-02862S: Applications of Algebra and Combinatorics in Formal Language Theory</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)