License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2017.39
URN: urn:nbn:de:0030-drops-69945
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/6994/
Go to the corresponding LIPIcs Volume Portal

van Gool, Samuel J. ; Steinberg, Benjamin

Pro-Aperiodic Monoids via Saturated Models

pdf-format:
LIPIcs-STACS-2017-39.pdf (0.5 MB)

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.

BibTeX - Entry

@InProceedings{vangool_et_al:LIPIcs:2017:6994,
  author =	{Samuel J. van Gool and Benjamin Steinberg},
  title =	{{Pro-Aperiodic Monoids via Saturated Models}},
  booktitle =	{34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
  pages =	{39:1--39:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-028-6},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{66},
  editor =	{Heribert Vollmer and Brigitte ValleĢe},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/6994},
  URN =		{urn:nbn:de:0030-drops-69945},
  doi =		{10.4230/LIPIcs.STACS.2017.39},
  annote =	{Keywords: aperiodic monoids, profinite monoids, Stone duality, saturated models}
}

Keywords: aperiodic monoids, profinite monoids, Stone duality, saturated models
Collection: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
Issue Date: 2017
Date of publication: 06.03.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI