NORMAL FORMS FOR FREE APERIODIC SEMIGROUPS

DOI10.1142/S0218196701000693zbMath1026.20037MaRDI QIDQ4786300

Jonathan P. McCammond

Publication date: 15 December 2002

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

word problemfinite semigroupsimplicit operationspseudovarietiespseudoidentitiesKrohn-Rhodes complexityfree aperiodic semigroups

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items

PROFINITE METHODS IN SEMIGROUP THEORY ⋮ FURTHER RESULTS ON MONOIDS ACTING ON TREES ⋮ The word problem for omega-terms over the Trotter-Weil hierarchy ⋮ McCammond’s normal forms for free aperiodic semigroups revisited ⋮ Iterated periodicity over finite aperiodic semigroups ⋮ The word problem for \(\omega \)-terms over DA ⋮ Closures of regular languages for profinite topologies. ⋮ Towards a pseudoequational proof theory ⋮ On bases of identities for the \(\omega\)-variety generated by locally testable semigroups. ⋮ Unified theory for finite Markov chains ⋮ The word problem for \(\kappa \)-terms over the pseudovariety of local groups ⋮ The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages ⋮ Dynamics of implicit operations and tameness of pseudovarieties of groups ⋮ The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy ⋮ Pro-aperiodic monoids via saturated models ⋮ Semigroup presentations for test local groups. ⋮ COMPLETE REDUCIBILITY OF THE PSEUDOVARIETY LS1 ⋮ Profinite topologies ⋮ Normal distributions of finite Markov chains ⋮ On $$\omega $$-Identities over Finite Aperiodic Semigroups with Commuting Idempotents

Cites Work

• On noncounting regular classes
• Profinite semigroups, Mal'cev products, and identities
• THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUP SATISFYING T^m=T^m+n WITH m≥4 OR m=3, n=1
• THE SOLUTION TO THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUPS SATISFYING T^a = T^a+b WITH a ≥ 6
• On the Decidability of Iterated Semidirect Products with Applications to Complexity