The inclusion problem for unambiguous rational trace languages

  • Authors:

  • Paolo Massazza

  • Affiliations:

  • Dipartimento di Informatica e Comunicazione, Università degli Studi dell'Insubria, Varese, Italia

  • Venue:
  • DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given a class $\mathcal{C}$ of languages, the Inclusion Problem for $\mathcal{C}$ consists of deciding whether for $L_{1},L_{2}\in\mathcal{C}$ we have L1⊆L2. In this work we prove that the Inclusion Problem is decidable for the class of unambiguous rational trace languages that are subsets of the monoid (((a$_{\rm 1}^{\rm \star}$b$_{\rm 1}^{\rm \star}$)× c$_{\rm 1}^{\rm \star}$)((a$_{\rm 2}^{\rm \star}$b$_{\rm 2}^{\rm \star}$)× c$_{\rm 2}^{\rm \star}$))× c$_{\rm 3}^{\rm \star}$.