CLASS OF MULTITAPE AUTOMATA WITH A DECIDABLE EQUIVALENCE PROBLEM.

被引：0
|
作者：
Kinber, E.B.
机构：
来源：
Programming and Computer Software (English Translation of Programmirovanie) | 1983年 / 9卷 / 03期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
6
引用
收藏
页码：121 / 127
相关论文
共 50 条
  • [41] ON THE EQUIVALENCE PROBLEM OF STATES FOR CELLULAR AUTOMATA
    BOLOTOV, AA
    LECTURE NOTES IN COMPUTER SCIENCE, 1987, 278 : 53 - 54
  • [42] THE SEQUENCE EQUIVALENCE PROBLEM IS DECIDABLE FOR 0S SYSTEMS
    EHRENFEUCHT, A
    ROZENBERG, G
    JOURNAL OF THE ACM, 1980, 27 (04) : 656 - 663
  • [43] THE OMEGA-SEQUENCE EQUIVALENCE PROBLEM FOR DOL SYSTEMS IS DECIDABLE
    CULIK, K
    HARJU, T
    JOURNAL OF THE ACM, 1984, 31 (02) : 282 - 298
  • [44] A class of information logics with a decidable validity problem
    Demri, S
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1996, 1996, 1113 : 291 - 302
  • [45] HDTOL MATCHING OF COMPUTATIONS OF MULTITAPE AUTOMATA
    CULIK, K
    KARHUMAKI, J
    ACTA INFORMATICA, 1989, 27 (02) : 179 - 191
  • [46] Complete System of Equivalent Transformations for Multitape Automata
    V. E. Khachatryan
    Programming and Computer Software, 2003, 29 : 43 - 54
  • [47] Positive loop-closed automata: a decidable class of hybrid systems
    Li, XD
    Zhao, JH
    Pei, Y
    Li, Y
    Zheng, T
    Zheng, GL
    JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 2002, 52-3 : 79 - 108
  • [48] Automata transformations of prefix decidable and decidable by Buchi superwords
    Korneeva N.N.
    Russian Mathematics, 2016, 60 (7) : 47 - 55
  • [49] RESULT ON EQUIVALENCE PROBLEM FOR DETERMINISTIC PUSHDOWN AUTOMATA
    TANIGUCHI, K
    KASAMI, T
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (01) : 38 - 50
  • [50] THE EQUIVALENCE PROBLEM FOR DETERMINISTIC 2-WAY SEQUENTIAL TRANSDUCERS IS DECIDABLE
    GURARI, EM
    SIAM JOURNAL ON COMPUTING, 1982, 11 (03) : 448 - 452
12345