On finitely recognizable semigroups

DOI10.1007/BF01193579zbMath0737.20030OpenAlexW1983217319MaRDI QIDQ811558

Stefano Varricchio, Aldo De Luca

Publication date: 1992

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01193579

zbMATH Keywords

decomposition theoremfinitely based varietyfinitely presentedfinitely generatedsolvable word problem\(\mathcal J\)-depth functionBurnside varietiesfinite \(\mathcal J\)-above semigroupsfinitely recognizable semigroups

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05)

Related Items (3)

Eraser morphisms and membership problem in groups and monoids ⋮ Proper/residually-finite idempotent semirings. ⋮ Stefano Varricchio (1960-2008)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Almost finite expansions of arbitrary semigroups
• Easy multiplications. II: Extensions of rational semigroups
• Easy multiplications. I: The realm of Kleene's theorem
• A finiteness condition for semigroups generalizing a theorem of Hotzel
• Finiteness and iteration conditions for semigroups
• THE SOLUTION TO THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUPS SATISFYING T^a = T^a+b WITH a ≥ 6
• COMBINATORIAL PROPERTIES OF UNIFORMLY RECURRENT WORDS AND AN APPLICATION TO SEMIGROUPS
• Free Inverse Semigroups
• The word problem for semigroups satisfying x³ = x
• Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem

This page was built for publication: On finitely recognizable semigroups