ON REGULAR TRACE LANGUAGES

被引：24
|
作者：
SAKAROVITCH, J
机构：
来源：
THEORETICAL COMPUTER SCIENCE | 1987年 / 52卷 / 1-2期
关键词：
D O I：
10.1016/0304-3975(87)90080-6
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：59 / 75
页数：17
相关论文
共 50 条
  • [41] On fuzzy regular languages
    Malik, DS
    Mordeson, JN
    Sen, MK
    INFORMATION SCIENCES, 1996, 88 (1-4) : 263 - 273
  • [42] Containment of regular languages in non-regular timing diagram languages is decidable
    Fisler, K
    COMPUTER AIDED VERIFICATION, 1997, 1254 : 155 - 166
  • [43] LANGUAGES VERSUS ω-LANGUAGES IN REGULAR INFINITE GAMES
    Chaturvedi, Namit
    Olschewski, Joerg
    Thomas, Wolfgang
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (05) : 985 - 1000
  • [44] Learning approximately regular languages with reversible languages
    Kobayashi, S
    Yokomori, T
    THEORETICAL COMPUTER SCIENCE, 1997, 174 (1-2) : 251 - 257
  • [45] Regular binoid expressions and regular binoid languages
    Hashiguchi, K
    Wada, Y
    Jimbo, S
    THEORETICAL COMPUTER SCIENCE, 2003, 304 (1-3) : 291 - 313
  • [46] Balanced-by-Construction Regular and ω-Regular Languages
    Edixhoven, Luc
    Jongmans, Sung-Shik
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2023, 34 (02N03) : 117 - 144
  • [47] Balanced-By-Construction Regular and ω-Regular Languages
    Edixhoven, Luc
    Jongmans, Sung-Shik
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2021, 2021, 12811 : 130 - 142
  • [48] ON APERIODIC TRACE LANGUAGES
    GUAIANA, G
    RESTIVO, A
    SALEMI, S
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 480 : 76 - 88
  • [49] LOGIC OF TRACE LANGUAGES
    RABINOVICH, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 630 : 504 - 517
  • [50] Separating Regular Languages by Piecewise Testable and Unambiguous Languages
    Place, Thomas
    van Rooijen, Lorijn
    Zeitoun, Marc
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013, 2013, 8087 : 729 - 740
12345