New decidable upper bound of the second level in the Straubing-Therien concatenation hierarchy of star-free languages - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2010

New decidable upper bound of the second level in the Straubing-Therien concatenation hierarchy of star-free languages

Abstract

In a recent paper we gave a counterexample to a longstanding conjecture concerning the characterization of regular languages of level 2 in the Straubing-Therien concatenation hierarchy of star-free languages. In that paper a new upper bound for the corresponding pseudovariety of monoids was implicitly given. In this paper we show that it is decidable whether a given monoid belongs to the new upper bound. We also prove that this new upper bound is incomparable with the previous upper bound.
Fichier principal
Vignette du fichier
1463-5646-1-PB.pdf (189.64 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00990443 , version 1 (13-05-2014)

Identifiers

Cite

Jorge Almeida, Ondrej Klima. New decidable upper bound of the second level in the Straubing-Therien concatenation hierarchy of star-free languages. Discrete Mathematics and Theoretical Computer Science, 2010, Vol. 12 no. 4 (4), pp.41-58. ⟨10.46298/dmtcs.490⟩. ⟨hal-00990443⟩

Collections

TDS-MACS
110 View
833 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More