Equations and dot-depth one
type: Item
instance of: scholarly article
title: Equations and dot-depth one
zbMATH Open document ID: 0814.20048
DOI: 10.1007/BF02573768
published in: Semigroup Forum
publication date: 1995-06-13T00:00:00Z
full work available at URL: https://eudml.org/doc/135281
review text: Let \(V_{k,m}\) denote the finite monoid varieties corresponding to the Straubing hierarchy of star-free languages. The author studies whether these varieties are finitely based. For every pair of integers \(r \geq 0\), \(m \geq 1\) a finite sequence of equations \(C_ m^ r\) is constructed such that \(C_ m^ 0 = \{x^ m = x^{m+1}\}\) and \(C_ m^ r \sqsubseteq C_ m^ s\) if \(r \leq s\). Theorem 1: Let \(M\) be a monoid generated by a set of \(r + 1\) elements, \(r \geq 0\). Then \(M\) belongs to \(V_{1,m}\) iff \(M\) satisfies the equations in \(C_ m^ r\). The equations \(\bigcup\{C_ m^ r : r \geq 0\}\) define the variety \(V_{1,m}\). Theorem 2: The family of equations \(\bigcup\{C_ m^ r : r \geq 0\}\) is equivalent to \(C_ m^ s\), where \(s= 1\) if \(m \in \{1,2\}\) and \(s = 2\) if \(m = 3\). Thus the variety \(V_{1,m}\) is finitely based if \(m = 1,2,3\). The author also constructs for every \(m\) a finite sequence of equations \(D_ m\) such that for every finite monoid \(M\) generated by \(2\) elements, \(M \in V_{2,1}\) iff \(M\) ultimately satisfies the equations in \(\bigcup\{D_ m : m \geq 1\}\).
Mathematics Subject Classification ID: 20M35
Mathematics Subject Classification ID: 20M07
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 20M05
zbMATH DE Number: 438889
zbMATH Keywords: finitely based varieties
zbMATH Keywords: finite monoid varieties
zbMATH Keywords: Straubing hierarchy
zbMATH Keywords: star-free languages
zbMATH Keywords: sequence of equations
author: F. Blanchet-Sadri
reviewed by: Awad A. Iskander
MaRDI profile type: Publication
cites work: Games, equations and the dot-depth hierarchy
cites work: On dot-depth two
cites work: Games, equations and dot-depth two monoids
cites work: The dot-depth hierarchy of star-free languages is infinite
cites work: Characterizations of locally testable events
cites work: Dot-depth of star-free events
cites work: Q4132170
cites work: Q3673124
cites work: Q3853827
cites work: Q5641083
cites work: On finite monoids having only trivial subgroups
cites work: Finite semigroup varieties of the form V*D
cites work: Q3730029
cites work: Classifying regular events in symbolic logic
OpenAlex ID: W2051741672
description: scientific article; zbMATH DE number 438889