On Bounded Rational Trace Languages

被引：0
|
作者：
Christian Choffrut
Flavio D’Alessandro
Stefano Varricchio
机构：
[1] Université de Paris 7,Laboratoire LIAFA
[2] Università di Roma “La Sapienza”,Dipartimento di Matematica
[3] Università di Roma “Tor Vergata”,Dipartimento di Matematica
来源：
Theory of Computing Systems | 2010年 / 46卷
关键词：
Trace languages; Bounded languages; Rational relations;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper, for a finitely generated monoid M, we tackle the following three questions: Is it possible to give a characterization of rational subsets of M which have polynomial growth?What is the structure of the counting function of rational sets which have polynomial growth?Is it true that every rational subset of M has either exponential growth or it has polynomial growth? Can one decide for a given rational set which of the two options holds? We give a positive answer to all the previous questions in the case that M is a direct product of free monoids. Some of the proved results also extend to trace monoid.
引用
收藏
页码：351 / 369
页数：18
相关论文
共 50 条
  • [1] On Bounded Rational Trace Languages
    Choffrut, Christian
    D'Alessandro, Flavio
    Varricchio, Stefano
    [J]. THEORY OF COMPUTING SYSTEMS, 2010, 46 (02) : 351 - 369
  • [2] RATIONAL AND RECOGNIZABLE COMPLEX TRACE LANGUAGES
    DIEKERT, V
    GASTIN, P
    PETIT, A
    [J]. INFORMATION AND COMPUTATION, 1995, 116 (01) : 134 - 153
  • [3] WORDS WITHOUT REPETITION AND BOUNDED RATIONAL LANGUAGES
    RESTIVO, A
    [J]. RAIRO-INFORMATIQUE THEORIQUE-THEORETICAL COMPUTER SCIENCE, 1977, 11 (03): : 197 - 202
  • [4] THE LAST DECISION PROBLEM FOR RATIONAL TRACE LANGUAGES
    SAKAROVITCH, J
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 583 : 460 - 473
  • [5] The inclusion problem for unambiguous rational trace languages
    Massazza, P
    [J]. DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2005, 3572 : 350 - 361
  • [6] LOGICAL DEFINABILITY OF SOME RATIONAL TRACE LANGUAGES
    CHOFFRUT, C
    GUERRA, L
    [J]. MATHEMATICAL SYSTEMS THEORY, 1995, 28 (05): : 397 - 420
  • [7] A Note on the Logical Definability of Rational Trace Languages
    Choffrut, Christian
    [J]. FUNDAMENTA INFORMATICAE, 2012, 116 (1-4) : 45 - 50
  • [8] Rational Index of Languages with Bounded Dimension of Parse Trees
    Shemetova, Ekaterina
    Okhotin, Alexander
    Grigorev, Semyon
    [J]. DEVELOPMENTS IN LANGUAGE THEORY (DLT 2022), 2022, 13257 : 263 - 273
  • [9] Rational graphs trace context-sensitive languages
    Morvan, C
    Stirling, C
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001, 2001, 2136 : 548 - 559
  • [10] 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
12345