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 条

[21] Amalgams of finite inverse semigroups and deterministic context-free languages
A. Cherubini
C. Nuccio
E. Rodaro
Semigroup Forum, 2012, 85 : 129 - 146
[22] A SUBCLASS OF DETERMINISTIC CONTEXT-FREE LANGUAGES WITH A DECIDABLE INCLUSION PROBLEM
GORSHKOV, PV
STAVROVSKII, AB
CYBERNETICS, 1990, 26 (02): : 156 - 162
[23] A CHARACTERIZATION THEOREM FOR CERTAIN BOUNDED DETERMINISTIC CONTEXT-FREE LANGUAGES
JONES, LP
GOLDSTINE, J
INFORMATION AND CONTROL, 1980, 47 (03): : 220 - 236
[24] On groups which are syntactic monoids of deterministic context-free languages
Röver, CE
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2004, 14 (04) : 499 - 504
[25] EQUIVALENCE AND SUBCLASS CONTAINMENT PROBLEMS FOR DETERMINISTIC CONTEXT-FREE LANGUAGES
FRIEDMAN, EP
GREIBACH, SA
INFORMATION PROCESSING LETTERS, 1978, 7 (06) : 287 - 290
[26] TAPE BOUNDS FOR SOME SUBCLASSES OF DETERMINISTIC CONTEXT-FREE LANGUAGES
IGARASHI, Y
INFORMATION AND CONTROL, 1978, 37 (03): : 321 - 333
[27] Amalgams of finite inverse semigroups and deterministic context-free languages
Cherubini, A.
Nuccio, C.
Rodaro, E.
SEMIGROUP FORUM, 2012, 85 (01) : 129 - 146
[28] Comparing consecutive letter counts in multiple context-free languages
Lehner, Florian
Lindorfer, Christian
THEORETICAL COMPUTER SCIENCE, 2021, 868 : 1 - 5
[29] About one expansion of class of context-free languages
Dubasova, O.A.
Mel'nikov, B.F.
Programmirovanie, 1995, (06): : 46 - 59
[30] A PUMPING LEMMA FOR REAL-TIME DETERMINISTIC CONTEXT-FREE LANGUAGES
IGARASHI, Y
THEORETICAL COMPUTER SCIENCE, 1985, 36 (01) : 89 - 97

← 1 2 3 4 5 →