On the inclusion problem for finitely ambiguous rational trace languages

被引：2
|
作者：
Bertoni, A [1 ]
Massazza, P [1 ]
机构：
[1] Univ Milan, Dipartimento Sci Informaz, I-20135 Milan, Italy
来源：
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS | 1998年 / 32卷 / 1-3期
关键词：
D O I：
10.1051/ita/1998321-300791
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this work we prove that the Inclusion Problem is decidable for a particular class of trace languages that is the class R-FIN (Sigma, C) of finitely ambiguous rational trace languages over an alphabet Sigma = A boolean OR B with the commutation relation C = (A x Sigma boolean OR Sigma x A)\I. (C) Elsevier, Paris.
引用
收藏
页码：79 / 98
页数：20
相关论文
共 50 条
  • [1] The inclusion problem for unambiguous rational trace languages
    Massazza, P
    [J]. DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2005, 3572 : 350 - 361
  • [2] THE LAST DECISION PROBLEM FOR RATIONAL TRACE LANGUAGES
    SAKAROVITCH, J
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 583 : 460 - 473
  • [3] Random generation for finitely ambiguous context-free languages
    Bertoni, A
    Goldwurm, M
    Santini, M
    [J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2001, 35 (06): : 499 - 512
  • [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] RANK OF RATIONAL FINITELY GENERATED W-LANGUAGES
    LITOVSKY, I
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 380 : 308 - 317
  • [7] Decidability of the equivalence problem for finitely ambiguous finance automata
    Hashiguchi, K
    Ishiguro, K
    Jimbo, S
    [J]. INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2002, 12 (03) : 445 - 461
  • [8] RATIONAL OMEGA-LANGUAGES ARE NON-AMBIGUOUS
    ARNOLD, A
    [J]. THEORETICAL COMPUTER SCIENCE, 1983, 26 (1-2) : 221 - 223
  • [9] RATIONAL AND RECOGNIZABLE COMPLEX TRACE LANGUAGES
    DIEKERT, V
    GASTIN, P
    PETIT, A
    [J]. INFORMATION AND COMPUTATION, 1995, 116 (01) : 134 - 153
  • [10] RATIONAL LANGUAGES AND THE BURNSIDE PROBLEM
    RESTIVO, A
    REUTENAUER, C
    [J]. THEORETICAL COMPUTER SCIENCE, 1985, 40 (01) : 13 - 30
12345