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 条
  • [31] The equivalence problem for deterministic MSO tree transducers is decidable
    Engelfriet, Joost
    Maneth, Sebastian
    INFORMATION PROCESSING LETTERS, 2006, 100 (05) : 206 - 212
  • [32] CLASS OF SEMIGROUPS WITH A DECIDABLE WORD PROBLEM
    OGANESYAN, GU
    MATHEMATICAL NOTES, 1978, 24 (1-2) : 640 - 643
  • [33] DECIDABLE SUBCASES OF THE EQUIVALENCE PROBLEM FOR RECURSIVE PROGRAM SCHEMES
    COURCELLE, B
    GALLIER, JH
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1987, 21 (03): : 245 - 286
  • [34] Quantum finite multitape automata
    Ambainis, A
    Bonner, R
    Freivalds, R
    Golovkins, M
    Karpinski, M
    SOFSEM'99: THEORY AND PRACTICE OF INFORMATICS, 1999, 1725 : 340 - 348
  • [35] Fragments of ML Decidable by Nested Data Class Memory Automata
    Cotton-Barratt, Conrad
    Hopkins, David
    Murawski, Andrzej S.
    Ong, C. -H. Luke
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES (FOSSACS 2015), 2015, 9034 : 249 - 263
  • [36] A Decidable Class of Security Protocols for Both Reachability and Equivalence Properties
    Cortier, Veronique
    Delaune, Stephanie
    Sundararajan, Vaishnavi
    JOURNAL OF AUTOMATED REASONING, 2021, 65 (04) : 479 - 520
  • [37] ON THE CAPABILITIES OF ALTERNATING AND NONDETERMINISTIC MULTITAPE AUTOMATA
    GEIDMANIS, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1987, 278 : 150 - 154
  • [38] On size reduction techniques for multitape automata
    Tamm, Hellis
    Nykanen, Matti
    Ukkonen, Esko
    THEORETICAL COMPUTER SCIENCE, 2006, 363 (02) : 234 - 246
  • [39] A Decidable Class of Security Protocols for Both Reachability and Equivalence Properties
    Véronique Cortier
    Stéphanie Delaune
    Vaishnavi Sundararajan
    Journal of Automated Reasoning, 2021, 65 : 479 - 520
  • [40] On the Complexity of the Equivalence Problem for Probabilistic Automata
    Kiefer, Stefan
    Murawski, Andrzej S.
    Ouaknine, Joel
    Wachter, Bjoern
    Worrell, James
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, FOSSACS 2012, 2012, 7213 : 467 - 481
12345