Iteration of expansions. Unambiguous semigroups
From MaRDI portal
Publication:798782
DOI10.1016/0022-4049(84)90055-0zbMATH Open0547.20054OpenAlexW2077630085MaRDI QIDQ798782FDOQ798782
Authors: J.-C. Birget
Publication date: 1984
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-4049(84)90055-0
Recommendations
generatorsregular elementsprojective limits\({\mathcal J}\)-classinfinite chains of expansionslength of ascending \({\mathcal L}\)-chainsregular \({\mathcal D}\)-classright Rhodes expansionssemigroup expansion
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Infinite iteration of matrix semigroups. II: Structure theorem for arbitrary semigroups up to aperiodic morphism
- Almost finite expansions of arbitrary semigroups
- The synthesis theorem for finite regular semigroups, and its generalization
Cited In (32)
- Iterated periodicity over finite aperiodic semigroups
- A complete rewrite system and normal forms for \((S)_{\text{reg}}\)
- Representations of relatively free profinite semigroups, irreducibility, and order primitivity
- Title not available (Why is that?)
- The Szendrei expansion of a semigroup
- A short proof that \(\hat S^+_ A\) is finite if S is finite
- A correspondence between a class of monoids and self-similar group actions. I.
- On Rhodes expansions of bands
- Two algebraic approaches to variants of the concatenation product
- Graph inverse semigroups: their characterization and completion.
- Compactable semilattices
- Infinite iteration of matrix semigroups. II: Structure theorem for arbitrary semigroups up to aperiodic morphism
- Almost finite expansions of arbitrary semigroups
- Unambiguous Büchi automata.
- A correspondence between a class of monoids and self-similar group actions II
- Heights of posets associated with Green's relations on semigroups
- The ℛ-height of semigroups and their bi-ideals
- Expansions, free inverse semigroups, and Schützenberger product
- Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes
- The Rhodes expansion and free objects in varieties of completely regular semigroups
- Semigroups whose idempotents form a subsemigroup
- Prime decomposition theorem for arbitrary semigroups: General holonomy decomposition and synthesis theorem
- McAlister semigroups
- Stability and J-depth of expansions
- The generalized Szendrei expansion of an \(\mathcal R\)-unipotent semigroup.
- Arbitrary vs. regular semigroups
- A Structure Preserving Embedding of Semigroups Into Regular Semigroups
- The Structure of 0-E-unitary inverse semigroups I: the monoid case
- On calculating the Krohn-Rhodes decomposition of automata
- The synthesis theorem for finite regular semigroups, and its generalization
- Title not available (Why is that?)
- An embedding of semigroups into regular semigroups that preserves structure and finiteness.
This page was built for publication: Iteration of expansions. Unambiguous semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798782)