SAFE EXECUTIONS OF RECOGNIZABLE TRACE LANGUAGES BY ASYNCHRONOUS AUTOMATA

被引:0
|
作者
ZIELONKA, W
机构
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:278 / 289
页数:12
相关论文
共 50 条
  • [41] A Myhill-Nerode theorem for register automata and symbolic trace languages
    Vaandrager, Frits
    Midya, Abhisek
    THEORETICAL COMPUTER SCIENCE, 2022, 912 : 37 - 55
  • [42] An Automata-Theoretical Characterization of Context-Free Trace Languages
    Nagy, Benedek
    Otto, Friedrich
    SOFSEM 2011: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2011, 6543 : 406 - 417
  • [43] A SURVEY OF RECOGNIZABLE LANGUAGES OF INFINITE TRACES
    GASTIN, P
    PETIT, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 609 : 392 - 409
  • [44] On Subclasses of Recognizable ?? - Partial Array Languages
    Muhiuddin, G.
    Janaki, K.
    Al-Kadi, D.
    Arulprakasam, R.
    Govindan, V.
    JOURNAL OF MATHEMATICS, 2022, 2022
  • [45] On logically defined recognizable tree languages
    Ésik, Z
    Weil, P
    FST TCS 2003: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 2003, 2914 : 195 - 207
  • [46] Languages not recognizable in real time by one-dimensional cellular automata (vol 74, pg 1095, 2008)
    Nakamura, Katsuhiko
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2009, 75 (07) : 421 - 421
  • [47] Local and recognizable hexagonal picture languages
    Dersanambika, KS
    Krithivasan, K
    Martin-Vide, C
    Subramanian, KG
    INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2005, 19 (07) : 853 - 871
  • [48] ZETA-FUNCTIONS OF RECOGNIZABLE LANGUAGES
    BERSTEL, J
    REUTENAUER, C
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 317 : 93 - 104
  • [49] On some recognizable picture-languages
    Reinhardt, K
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1998, 1998, 1450 : 760 - 770
  • [50] Recognizable picture languages and domino tiling
    Latteux, M
    Simplot, D
    THEORETICAL COMPUTER SCIENCE, 1997, 178 (1-2) : 275 - 283