The inclusion problem for unambiguous rational trace languages

被引：0
|
作者：
Massazza, P [1 ]
机构：
[1] Univ Insubria, Dipartimento Informat & Comunicaz, I-21100 Varese, Italy
来源：
DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS | 2005年 / 3572卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Given a class C of languages, the Inclusion Problem for C consists of deciding whether for L-1, L-2 is an element of C we have L-1 subset of L-2. 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(1)(*) (.) b(1)(*)) x c(1)(*)) (.) ((a(2)(*) (.) b(2)(*)) x c(2)(*))) x c(3)(*).
引用
收藏
页码：350 / 361
页数：12
相关论文
共 50 条
  • [1] On the inclusion problem for finitely ambiguous rational trace languages
    Bertoni, A
    Massazza, P
    [J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1998, 32 (1-3): : 79 - 98
  • [2] THE LAST DECISION PROBLEM FOR RATIONAL TRACE LANGUAGES
    SAKAROVITCH, J
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 583 : 460 - 473
  • [3] ON THE EXISTENCE OF MINIMUM ASYNCHRONOUS AUTOMATA AND ON THE EQUIVALENCE PROBLEM FOR UNAMBIGUOUS REGULAR TRACE LANGUAGES
    BRUSCHI, D
    PIGHIZZINI, G
    SABADINI, N
    [J]. INFORMATION AND COMPUTATION, 1994, 108 (02) : 262 - 285
  • [4] On Bounded Rational Trace Languages
    Choffrut, Christian
    D'Alessandro, Flavio
    Varricchio, Stefano
    [J]. THEORY OF COMPUTING SYSTEMS, 2010, 46 (02) : 351 - 369
  • [5] On Bounded Rational Trace Languages
    Christian Choffrut
    Flavio D’Alessandro
    Stefano Varricchio
    [J]. Theory of Computing Systems, 2010, 46 : 351 - 369
  • [6] RATIONAL AND RECOGNIZABLE COMPLEX TRACE LANGUAGES
    DIEKERT, V
    GASTIN, P
    PETIT, A
    [J]. INFORMATION AND COMPUTATION, 1995, 116 (01) : 134 - 153
  • [7] RATIONAL LANGUAGES AND THE BURNSIDE PROBLEM
    RESTIVO, A
    REUTENAUER, C
    [J]. THEORETICAL COMPUTER SCIENCE, 1985, 40 (01) : 13 - 30
  • [8] Equivalence and Inclusion Problem for Strongly Unambiguous Buchi Automata
    Bousquet, Nicolas
    Loeding, Christof
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2010, 6031 : 118 - 129
  • [9] LOGICAL DEFINABILITY OF SOME RATIONAL TRACE LANGUAGES
    CHOFFRUT, C
    GUERRA, L
    [J]. MATHEMATICAL SYSTEMS THEORY, 1995, 28 (05): : 397 - 420
  • [10] A Note on the Logical Definability of Rational Trace Languages
    Choffrut, Christian
    [J]. FUNDAMENTA INFORMATICAE, 2012, 116 (1-4) : 45 - 50
12345