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

Jorge Almeida 1 Ondrej Klima 2
1 Departamento de Matemática [Porto]
2 Department of Mathematics and Statistics [Btno]
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.
Keywords : formal languages regular languages concatenation hierarchies level two star-free languages
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2010, 12 (4), pp.41-58
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger
https://hal.inria.fr/hal-00990443
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : mardi 13 mai 2014 - 15:37:14
Dernière modification le : mercredi 29 novembre 2017 - 10:26:19
Document(s) archivé(s) le : lundi 10 avril 2017 - 22:26:23

Fichier

1463-5646-1-PB.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00990443, version 1

Collections

TDS-MACS

Citation

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, DMTCS, 2010, 12 (4), pp.41-58. 〈hal-00990443〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

195

Téléchargements de fichiers

334

Contact


archive-ouverte@inria.fr