Pro-aperiodic monoids via saturated models

Open Access
Authors
Publication date 03-2017
Host editors
  • H. Vollmer
  • B. Vallée
Book title 34th Symposium on Theoretical Aspects of Computer Science
Book subtitle STACS 2017, March 8-11, 2017, Hannover, Germany
ISBN (electronic)
  • 9783959770286
Series Leibniz International Proceedings in Informatics
Event 34th Symposium on Theoretical Aspects of Computer Science
Article number 39
Number of pages 14
Publisher Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Organisations
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
Abstract
We apply Stone duality and model theory to study the structure theory of free pro-aperiodic monoids. Stone duality implies that elements of the free pro-aperiodic monoid may be viewed as elementary equivalence classes of pseudofinite words. Model theory provides us with saturated words in each such class, i.e., words in which all possible factorizations are realized. We give several applications of this new approach, including a solution to the word problem for omega-terms that avoids using McCammond's normal forms, as well as new proofs and extensions of other structural results concerning free pro-aperiodic monoids.
Document type Conference contribution
Language English
Published at https://doi.org/10.4230/LIPIcs.STACS.2017.39
Other links http://drops.dagstuhl.de/opus/portals/lipics/index.php?semnr=16029
Downloads
LIPIcs-STACS-2017-39 (Final published version)
Permalink to this page
Back