Inferring pure context-free languages from positive data

被引：0

|

作者：

Koshiba, Takeshi

Makinen, Erkki

Takada, Yuji

机构：

来源：

Acta Cybernetica | 2000年 / 14卷 / 03期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：469 / 477

相关论文

共 50 条

[31] A NOTE ON CONTEXT-FREE LANGUAGES
WALTERS, RFC
JOURNAL OF PURE AND APPLIED ALGEBRA, 1989, 62 (02) : 199 - 203
[32] Efficient recognition algorithms for parallel multiple context-free languages and for multiple context-free languages
Nakanishi, R
Takada, K
Nii, H
Seki, H
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1998, E81D (11) : 1148 - 1161
[33] INDUCTIVE INFERENCE OF CONTEXT-FREE LANGUAGES BASED ON CONTEXT-FREE EXPRESSIONS
YOKOMORI, T
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1988, 24 (02) : 115 - 140
[34] METHOD FOR INFERRING CONTEXT-FREE GRAMMARS
KNOBE, B
KNOBE, K
INFORMATION AND CONTROL, 1976, 31 (02): : 129 - 146
[35] INFERENCE OF CONTEXT-FREE LANGUAGES FROM STRUCTURAL DESCRIPTIONS
FASS, LF
JOURNAL OF SYMBOLIC LOGIC, 1986, 51 (03) : 842 - 842
[36] Fractal Automata: Recursion in Context-Free and in Deterministic and Linear Context-Free Languages
Nagy, Benedek
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2025,
[37] Learning Context-Free Grammars from Positive Data and Membership Queries
Kanazawa, Makoto
LOGIC, LANGUAGE, INFORMATION, AND COMPUTATION, WOLLIC 2023, 2023, 13923 : 3 - 18
[38] Expressiveness and complexity of regular pure two-dimensional context-free languages
Bersani, Marcello M.
Frigeri, Achille
Cherubini, Alessandra
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2013, 90 (08) : 1708 - 1733
[39] On the Density of Context-Free and Counter Languages
Eremondi, Joey
Ibarra, Oscar H.
McQuillan, Ian
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2018, 29 (02) : 233 - 250
[40] CONTEXT-FREE COMPLEXITY OF FINITE LANGUAGES
BUCHER, W
MAURER, HA
CULIK, K
THEORETICAL COMPUTER SCIENCE, 1984, 28 (03) : 277 - 285

← 1 2 3 4 5 →