CHARACTERIZATIONS OF THE DECIDABILITY OF SOME PROBLEMS FOR REGULAR TRACE LANGUAGES

被引：29
|
作者：
AALBERSBERG, IJJ [1 ]
HOOGEBOOM, HJ [1 ]
机构：
[1] STATE UNIV LEIDEN,DEPT COMP SCI,2312 AV LEIDEN,NETHERLANDS
来源：
MATHEMATICAL SYSTEMS THEORY | 1989年 / 22卷 / 01期
关键词：
D O I：
10.1007/BF02088289
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：1 / 19
页数：19
相关论文
共 50 条
  • [1] Word problems of groups: Formal languages, characterizations and decidability
    Jones, Sam A. M.
    Thomas, Richard M.
    THEORETICAL COMPUTER SCIENCE, 2018, 750 : 2 - 23
  • [2] On Decidability of Theories of Regular Languages
    Dudakov, Sergey
    Karlov, Boris
    THEORY OF COMPUTING SYSTEMS, 2021, 65 (03) : 462 - 478
  • [3] On Decidability of Regular Languages Theories
    Dudakov, Sergey
    Karlov, Boris
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2019, 11532 : 119 - 130
  • [4] Decidability of Geometricity of Regular Languages
    Beal, Marie-Pierre
    Champarnaud, Jean-Marc
    Dubernard, Jean-Philippe
    Jeanne, Hadrien
    Lombardy, Sylvain
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2012), 2012, 7410 : 62 - 72
  • [5] On Decidability of Theories of Regular Languages
    Sergey Dudakov
    Boris Karlov
    Theory of Computing Systems, 2021, 65 : 462 - 478
  • [6] EQUIVALENCE AND MEMBERSHIP PROBLEMS FOR REGULAR TRACE LANGUAGES
    BERTONI, A
    MAURI, G
    SABADINI, N
    LECTURE NOTES IN COMPUTER SCIENCE, 1982, 140 : 61 - 71
  • [7] Decidability of hierarchies of regular aperiodic languages
    Selivanov V.L.
    Algebra and Logic, 2002, 41 (5) : 337 - 348
  • [8] ON REGULAR TRACE LANGUAGES
    SAKAROVITCH, J
    THEORETICAL COMPUTER SCIENCE, 1987, 52 (1-2) : 59 - 75
  • [9] MEMBERSHIP PROBLEMS FOR REGULAR AND CONTEXT-FREE TRACE LANGUAGES
    BERTONI, A
    MAURI, G
    SABADINI, N
    INFORMATION AND COMPUTATION, 1989, 82 (02) : 135 - 150
  • [10] Membership problems for regular and context-free trace languages
    Bertoni, A., 1600, (82):
12345