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 条

[31] Stronger separation of analog neuron hierarchy by deterministic context-free languages
Sima, Jiri
NEUROCOMPUTING, 2022, 493 : 605 - 612
[32] A GRAPH-BASED REGULARITY TEST FOR DETERMINISTIC CONTEXT-FREE LANGUAGES
SHANKAR, P
ADIGA, BS
THEORETICAL COMPUTER SCIENCE, 1991, 88 (01) : 117 - 125
[33] NATURAL LANGUAGES AND CONTEXT-FREE LANGUAGES
PULLUM, GK
GAZDAR, G
LINGUISTICS AND PHILOSOPHY, 1982, 4 (04) : 471 - 504
[34] Free products of semigroups and monoids with a deterministic context-free word problem
Kostolanyi, Peter
INFORMATION PROCESSING LETTERS, 2025, 188
[35] PARALLEL CONTEXT-FREE LANGUAGES
SKYUM, S
INFORMATION AND CONTROL, 1974, 26 (03): : 280 - 285
[36] ON ENTROPY OF CONTEXT-FREE LANGUAGES
KUICH, W
INFORMATION AND CONTROL, 1970, 16 (02): : 173 - +
[37] ON THE RECOGNITION OF CONTEXT-FREE LANGUAGES
RYTTER, W
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 208 : 318 - 325
[38] CONTEXT-FREE AND STATIONARY LANGUAGES
THIERRIN, G
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1979, 7 (04) : 297 - 301
[39] CONTEXT-FREE FUZZY LANGUAGES
SANTOS, ES
INFORMATION AND CONTROL, 1974, 26 (01): : 1 - 11
[40] Logics for context-free languages
Lautemann, C
Schwentick, T
Therien, D
COMPUTER SCIENCE LOGIC, 1995, 933 : 205 - 216

← 1 2 3 4 5 →