On the algorithmic decidability of the second-type annihilation predicate for varieties of semigroups

DOI10.3103/S1063454110040072MaRDI QIDQ1759565zbMATH OpenFDO

Authors I. I. Kostyrev

Publication date 21 November 2012

Published in Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/S1063454110040072

zbMATH Keywords

algorithmic decidabilityfinite approximabilitysecond-type annihilation predicatesemigroup

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Algebraic theory of languages and automata (68Q70)

Recommendations

• scientific article; zbMATH DE number 4051899
• scientific article; zbMATH DE number 3910647
• Algorithmic problems in varieties of semigroups
• scientific article; zbMATH DE number 18506
• scientific article; zbMATH DE number 989181

This page was built for publication: On the algorithmic decidability of the second-type annihilation predicate for varieties of semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1759565)