A SUBCLASS OF DETERMINISTIC CONTEXT-FREE LANGUAGES WITH A DECIDABLE INCLUSION PROBLEM

被引：0

作者：

GORSHKOV, PV

STAVROVSKII, AB

机构：

来源：

CYBERNETICS | 1990年 / 26卷 / 02期

关键词：

D O I：

10.1007/BF01068604

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

A new subclass of deterministic context-free languages with a decidable inclusion problem is described in terms of finite automata on the direct product of free semigroups. The decidability proof exploits the structural properties of the automata. © 1990 Plenum Publishing Corporation.

引用

页码：156 / 162

页数：7

共 50 条

[11] A PUMPING LEMMA FOR DETERMINISTIC CONTEXT-FREE LANGUAGES
YU, S
INFORMATION PROCESSING LETTERS, 1989, 31 (01) : 47 - 51
[12] A CLOSURE PROPERTY OF DETERMINISTIC CONTEXT-FREE LANGUAGES
CHOFFRUT, C
INFORMATION PROCESSING LETTERS, 1981, 12 (01) : 13 - 16
[13] A Structural Lemma for Deterministic Context-Free Languages
Rubtsov, Alexander A.
DEVELOPMENTS IN LANGUAGE THEORY, DLT 2018, 2018, 11088 : 553 - 565
[14] Homomorphisms Preserving Deterministic Context-Free Languages
Lehtinen, Tommi
Okhotin, Alexander
DEVELOPMENTS IN LANGUAGE THEORY (DLT 2012), 2012, 7410 : 154 - 165
[15] INCLUSION RELATIONS AMONG FAMILIES OF CONTEXT-FREE LANGUAGES
YNTEMA, MK
INFORMATION AND CONTROL, 1967, 10 (06): : 572 - +
[16] Membership problem for head languages and multiple context-free languages
Kasami, Tadao, 1600, (20):
[17] Amalgams of finite inverse semigroups and deterministic context-free languages
A. Cherubini
C. Nuccio
E. Rodaro
Semigroup Forum, 2012, 85 : 129 - 146
[18] A CHARACTERIZATION THEOREM FOR CERTAIN BOUNDED DETERMINISTIC CONTEXT-FREE LANGUAGES
JONES, LP
GOLDSTINE, J
INFORMATION AND CONTROL, 1980, 47 (03): : 220 - 236
[19] 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
[20] TAPE BOUNDS FOR SOME SUBCLASSES OF DETERMINISTIC CONTEXT-FREE LANGUAGES
IGARASHI, Y
INFORMATION AND CONTROL, 1978, 37 (03): : 321 - 333

← 1 2 3 4 5 →