LBA-PROBLEM AND DETERMINISTIC TAPE COMPLEXITY OF 2-WAY ONE-COUNTER LANGUAGES OVER A ONE-LETTER ALPHABET

被引：2

|

作者：

MONIEN, B ^{[1
]}

机构：

[1] UNIV DORTMUND,INFORMAT ABT,D-4600 DORTMUND 50,FED REP GER

来源：

ACTA INFORMATICA | 1977年 / 8卷 / 04期

关键词：

D O I：

10.1007/BF00271345

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

收藏

页码：371 / 382

页数：12

相关论文

共 9 条

[1] Deterministic two-dimensional languages over one-letter alphabet
Anselmo, Marcella
Madonia, Maria
ALGEBRAIC INFORMATICS, 2007, 4728 : 147 - +
[2] 2-WAY MULTI-HEAD AUTOMATA OVER A ONE-LETTER ALPHABET
MONIEN, B
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1980, 14 (01): : 67 - 82
[3] Deterministic and unambiguous two-dimensional languages over one-letter alphabet
Anselmo, Marcella
Madonia, Maria
THEORETICAL COMPUTER SCIENCE, 2009, 410 (16) : 1477 - 1485
[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] Regular expressions for two-dimensional languages over one-letter alphabet
Anselmo, M
Giammarresi, D
Madonia, M
DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2004, 3340 : 63 - 75
[6] 3-WAY AUTOMATA ON RECTANGULAR TAPES OVER A ONE-LETTER ALPHABET
KINBER, EB
INFORMATION SCIENCES, 1985, 35 (01) : 61 - 77
[7] New operations and regular expressions for two-dimensional languages over one-letter alphabet
Anselmo, M
Giammarresi, D
Madonia, M
THEORETICAL COMPUTER SCIENCE, 2005, 340 (02) : 408 - 431
[8] ONE-SIDED DYCK REDUCTION OVER 2 LETTER ALPHABET AND DETERMINISTIC CONTEXT-FREE LANGUAGES
ROMIAN, F
SAKAROVITCH, J
LECTURE NOTES IN COMPUTER SCIENCE, 1986, 233 : 554 - 563
[9] LANGUAGES SIMULTANEOUSLY COMPLETE FOR ONE-WAY AND 2-WAY LOG-TAPE AUTOMATA
HARTMANIS, J
MAHANEY, S
SIAM JOURNAL ON COMPUTING, 1981, 10 (02) : 383 - 390