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 条
  • [21] A NEW CLASS OF CFL FOR WHICH THE EQUIVALENCE IS DECIDABLE
    SENIZERGUES, G
    INFORMATION PROCESSING LETTERS, 1981, 13 (01) : 30 - 34
  • [22] Size reduction of multitape automata
    Tamm, H
    Nykänen, M
    Ukkonen, E
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2005, 3317 : 329 - 330
  • [23] Equivalence of two-dimensional multitape automata (Vol 44, pg 1, 2008)
    Grigoryan, H. A.
    Shoukourian, S. K.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2008, 44 (03) : 464 - 464
  • [24] DETERMINISTIC MULTITAPE AUTOMATA COMPUTATIONS
    IGARASHI, Y
    HONDA, N
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 8 (02) : 167 - 189
  • [25] The Equivalence Problem for Finite Automata
    Henzinger, Thomas A.
    Raskin, Jean-Francois
    COMMUNICATIONS OF THE ACM, 2015, 58 (02) : 86 - 86
  • [26] Minimality and deadlockness of multitape automata
    Podlovchenko, R. I.
    Khachatryan, V. E.
    DISCRETE MATHEMATICS AND APPLICATIONS, 2008, 18 (03): : 271 - 292
  • [27] On Pebble Automata for Data Languages with Decidable Emptiness Problem
    Tan, Tony
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009, 2009, 5734 : 712 - 723
  • [28] On pebble automata for data languages with decidable emptiness problem
    Tan, Tony
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2010, 76 (08) : 778 - 791
  • [29] The equivalence problem for deterministic MSO tree transducers is decidable
    Engelfriet, J
    Maneth, S
    FSTTCS 2005: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2005, 3821 : 495 - 504
  • [30] Size reduction of multitape automata
    Tamm, H
    Nykänen, M
    Ukkonen, E
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2006, 3845 : 307 - 318
12345