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

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F10%3A00047226" target="_blank" >RIV/00216224:14310/10:00047226 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

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

Original language description

In a recent paper we gave a counterexample to a longstanding conjecture concerning the characterization of regular languages of level 2 in the Straubing-Thérien 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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2010

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Discrete Mathematics & Theoretical Computer Science

ISSN

1365-8050

e-ISSN

—

Volume of the periodical

12

Issue of the periodical within the volume

4

Country of publishing house

FR - FRANCE

Number of pages

18

Pages from-to

—

UT code for WoS article

000282651800004

EID of the result in the Scopus database

—