2-WAY MULTI-HEAD AUTOMATA OVER A ONE-LETTER ALPHABET

被引：0

|

作者：

MONIEN, B

机构：

来源：

RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS | 1980年 / 14卷 / 01期

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：67 / 82

页数：16

相关论文

共 50 条

[1] 3-WAY AUTOMATA ON RECTANGULAR TAPES OVER A ONE-LETTER ALPHABET
KINBER, EB
INFORMATION SCIENCES, 1985, 35 (01) : 61 - 77
[2] SOME HIERARCHY RESULTS ON MULTIHEAD AUTOMATA OVER A ONE-LETTER ALPHABET
WANG, Y
INOUE, K
TAKANAMI, I
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1993, E76D (06) : 625 - 633
[3] LBA-PROBLEM AND DETERMINISTIC TAPE COMPLEXITY OF 2-WAY ONE-COUNTER LANGUAGES OVER A ONE-LETTER ALPHABET
MONIEN, B
ACTA INFORMATICA, 1977, 8 (04) : 371 - 382
[4] REGULARITY OF ONE-LETTER LANGUAGES ACCEPTABLE BY 2-WAY FINITE PROBABILISTIC-AUTOMATA
KANEPS, J
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 529 : 287 - 296
[5] A note on emptiness for alternating finite automata with a one-letter alphabet
Jancar, Petr
Sawa, Zdenek
INFORMATION PROCESSING LETTERS, 2007, 104 (05) : 164 - 167
[6] UNSOLVABILITY OF THE EMPTINESS PROBLEM FOR ALTERNATING 1-WAY MULTI-HEAD AND MULTI-TAPE FINITE AUTOMATA OVER SINGLE-LETTER ALPHABET
GEIDMANIS, D
COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1991, 10 (02): : 133 - 141
[7] One-way reversible multi-head finite automata
Kutrib, Martin
Malcher, Andreas
THEORETICAL COMPUTER SCIENCE, 2017, 682 : 149 - 164
[8] UNRESTRICTED COMPLEMENTATION IN LANGUAGE EQUATIONS OVER A ONE-LETTER ALPHABET
LEISS, EL
THEORETICAL COMPUTER SCIENCE, 1994, 132 (1-2) : 71 - 84
[9] STATELESS ONE-WAY MULTI-HEAD FINITE AUTOMATA WITH PEBBLES
Kutrib, Martin
Malcher, Andreas
Wendlandt, Matthias
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2014, 25 (08) : 1141 - 1159
[10] SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA
Kutrib, Martin
Malcher, Andreas
Wendlandt, Matthias
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2014, 25 (07) : 877 - 896

← 1 2 3 4 5 →