Iterated periodicity over finite aperiodic semigroups
From MaRDI portal
Publication:2434750
DOI10.1016/j.ejc.2013.07.011zbMath1282.05212MaRDI QIDQ2434750
Jorge Almeida, Marc Zeitoun, José Carlos Costa
Publication date: 7 February 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2013.07.011
Related Items
Closures of regular languages for profinite topologies., The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages, Pro-aperiodic monoids via saturated models, McCammond’s normal forms for free aperiodic semigroups revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Categories as algebra: An essential ingredient in the theory of monoids
- Iteration of expansions. Unambiguous semigroups
- Infinite-vertex free profinite semigroupoids and symbolic dynamics.
- The Birkhoff theorem for finite algebras
- Profinite categories and semidirect products
- On some systems of equations with constraints in a free group. -- Addenda.
- Finite semigroup varieties of the form V*D
- Complete reducibility of systems of equations with respect to \(\mathbf R\).
- Complexity of finite semigroups
- Equidivisible semigroups
- McCammond’s normal forms for free aperiodic semigroups revisited
- INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
- THE SOLUTION TO THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUPS SATISFYING Ta = Ta+b WITH a ≥ 6
- Duality and Equational Theory of Regular Languages
- On The Profinite Topology on a Free Group
- On the Decidability of Iterated Semidirect Products with Applications to Complexity
- HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
- NORMAL FORMS FOR FREE APERIODIC SEMIGROUPS
- A SYNTACTICAL PROOF OF LOCALITY OF DA
- Extending partial automorphisms and the profinite topology on free groups
- SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS