ONE-SIDED DYCK REDUCTION OVER 2 LETTER ALPHABET AND DETERMINISTIC CONTEXT-FREE LANGUAGES

被引：0

|

作者：

ROMIAN, F

SAKAROVITCH, J

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1986年 / 233卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：554 / 563

页数：10

相关论文

共 50 条

[31] EQUIVALENCE PROBLEMS FOR DETERMINISTIC CONTEXT-FREE LANGUAGES AND MONADIC RECURSION SCHEMES
FRIEDMAN, EP
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1977, 14 (03) : 344 - 359
[32] A CHARACTERIZATION OF DETERMINISTIC CONTEXT-FREE LANGUAGES BY MEANS OF RIGHT-CONGRUENCES
SENIZERGUES, G
THEORETICAL COMPUTER SCIENCE, 1990, 70 (02) : 213 - 232
[33] Stronger separation of analog neuron hierarchy by deterministic context-free languages
Sima, Jiri
NEUROCOMPUTING, 2022, 493 : 605 - 612
[34] A GRAPH-BASED REGULARITY TEST FOR DETERMINISTIC CONTEXT-FREE LANGUAGES
SHANKAR, P
ADIGA, BS
THEORETICAL COMPUTER SCIENCE, 1991, 88 (01) : 117 - 125
[35] 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
[36] ONE-SIDED AND 2-SIDED CONTEXT IN FORMAL GRAMMARS
PENTTONEN, M
INFORMATION AND CONTROL, 1974, 25 (04): : 371 - 392
[37] Regular and Context-Free Pattern Languages over Small Alphabets
Reidenbach, Daniel
Schmid, Markus L.
DEVELOPMENTS IN LANGUAGE THEORY (DLT 2012), 2012, 7410 : 130 - 141
[38] Regular and context-free pattern languages over small alphabets
Reidenbach, Daniel
Schmid, Markus L.
THEORETICAL COMPUTER SCIENCE, 2014, 518 : 80 - 95
[39] CONCERNING 2-ADJACENT CONTEXT-FREE LANGUAGES
DAHLHAUS, E
GAIFMAN, H
THEORETICAL COMPUTER SCIENCE, 1985, 41 (2-3) : 169 - 184
[40] 2 COMPLEXITY-MEASURES FOR CONTEXT-FREE LANGUAGES
MAKINEN, E
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1988, 26 (01) : 29 - 34

← 1 2 3 4 5 →