Pro-aperiodic monoids via saturated models

DOI10.1007/s11856-019-1947-6OpenAlexW2984322096WikidataQ126841639 ScholiaQ126841639MaRDI QIDQ2279939

Benjamin Steinberg, Samuel J. van Gool

Publication date: 17 December 2019

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/6994/

Mathematics Subject Classification ID

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

Related Items (3)

Equidivisibility and profinite coproduct ⋮ Polyadic spaces and profinite monoids ⋮ Difference hierarchies and duality with an application to formal languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ultrafilters on words for a fragment of logic
• A combinatorial property of ideals in free profinite monoids.
• Infinite-vertex free profinite semigroupoids and symbolic dynamics.
• Model theory.
• The monadic theory of order
• The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages
• The equational theory of regular words
• Isomorphism of regular trees and words
• The linear nature of pseudowords
• Iterated periodicity over finite aperiodic semigroups
• Complexity of finite semigroups
• McCammond’s normal forms for free aperiodic semigroups revisited
• Ehrenfeucht-Fraisse Games on Omega-Terms
• Regular Languages of Words over Countable Linear Orderings
• Weak Second‐Order Arithmetic and Finite Automata
• THE SOLUTION TO THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUPS SATISFYING T^a = T^a+b WITH a ≥ 6
• Recognisable Languages over Monads
• Duality and Equational Theory of Regular Languages
• STABLE PAIRS
• A PROFINITE APPROACH TO STABLE PAIRS
• The Sch\"utzenberger product for syntactic spaces
• Pro-aperiodic monoids via saturated models
• IDEMPOTENT POINTLIKE SETS
• The Dot-Depth Hierarchy, 45 Years Later
• AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS
• Model Theory
• ON HYPERDECIDABLE PSEUDOVARIETIES OF SIMPLE SEMIGROUPS
• NORMAL FORMS FOR FREE APERIODIC SEMIGROUPS
• PROFINITE SEMIGROUPS, VARIETIES, EXPANSIONS AND THE STRUCTURE OF RELATIVELY FREE PROFINITE SEMIGROUPS
• Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
• On finite monoids having only trivial subgroups
• An effective lower bound for group complexity of finite semigroups and automata
• SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• The Theory of Representation for Boolean Algebras
• Stone duality, topological algebra, and recognition.

This page was built for publication: Pro-aperiodic monoids via saturated models