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 条

[1] An extension of context-free grammars with one-sided context specifications
Barash, Mikhail
Okhotin, Alexander
INFORMATION AND COMPUTATION, 2014, 237 : 268 - 293
[2] A hierarchy of deterministic context-free ω-languages
Duparc, J
THEORETICAL COMPUTER SCIENCE, 2003, 290 (03) : 1253 - 1300
[3] DYCK1-REDUCTIONS OF CONTEXT-FREE LANGUAGES
JANTZEN, M
KUDLEK, M
PETERSEN, H
LANGE, KJ
COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1990, 9 (01): : 3 - 18
[4] DYCK1-REDUCTIONS OF CONTEXT-FREE LANGUAGES
JANTZEN, M
KUDLEK, M
LANGE, KJ
PETERSEN, H
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 278 : 218 - 227
[5] Deterministic two-dimensional languages over one-letter alphabet
Anselmo, Marcella
Madonia, Maria
ALGEBRAIC INFORMATICS, 2007, 4728 : 147 - +
[6] One Analog Neuron Cannot Recognize Deterministic Context-Free Languages
Sima, Jiri
Platek, Martin
NEURAL INFORMATION PROCESSING (ICONIP 2019), PT III, 2019, 11955 : 77 - 89
[7] Fractal Automata: Recursion in Context-Free and in Deterministic and Linear Context-Free Languages
Nagy, Benedek
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2025,
[8] TAPE COMPLEXITY OF DETERMINISTIC CONTEXT-FREE LANGUAGES
SUDBOROUGH, IH
JOURNAL OF THE ACM, 1978, 25 (03) : 405 - 414
[9] HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES
Lehtinen, Tommi
Okhotin, Alexander
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2013, 24 (07) : 1049 - 1066
[10] Kolmogorov complexity and deterministic context-free languages
Glier, O
SIAM JOURNAL ON COMPUTING, 2003, 32 (05) : 1389 - 1394

← 1 2 3 4 5 →