New decidable upper bound of the second level in the Straubing-Therien concatenation hierarchy of star-free languages
type: Dataset
contact point: Organization
  fn: CCSD
keyword: infoinfo-dmcomputer-science-csdiscrete-mathematics-csdm
keyword: regular-languages
keyword: journal-articles
keyword: infoeu-reposemanticsarticle
keyword: concatenation-hierarchies
keyword: formal-languages
keyword: level-two
keyword: star-free-languages
landing page: 1462-7264
description: special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Applications
issued: 2026-05-05T11:23:39.793000
language: en
modified: 2026-05-05T11:23:39.793004

test_moissonnage_selune
type: Agent

New decidable upper bound of the second level in the Straubing-Therien concatenation hierarchy of star-free languages
type: Distribution
access URL: https://inria.hal.science/hal-00990443
format: HTML
issued: 2026-05-05T11:23:39.797755
modified: 2026-05-05T11:23:39.780835