Permutations and control sets for learning non-regular language families

被引：0

作者：

Fernau, H ^{[1
]}

Sempere, JM

机构：

[1] Univ Tubingen, Wilhelm Schickard Inst Informat, D-72076 Tubingen, Germany

[2] Univ Politecn Valencia, Dept Sistemas Informat & Computac, Valencia 46071, Spain

来源：

GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS | 2000年 / 1891卷

关键词：

formal languages; universal grammars; control sets; learning from positive data;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We discuss two versatile methods which can be used to transfer learnability results from one language class to another. We apply these methodologies to three learning paradigms: (1) Learning in the limit, (2) Morphic generator grammar inference, and (3) Query learning.

引用

页码：75 / 88

页数：14

共 3 条

[1] A positive extension of Eilenberg’s variety theorem for non-regular languages
A. Cano
J. Cantero
A. Martínez-Pastor
Applicable Algebra in Engineering, Communication and Computing, 2021, 32 : 553 - 573
[2] A positive extension of Eilenberg's variety theorem for non-regular languages
Cano, A.
Cantero, J.
Martinez-Pastor, A.
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2021, 32 (05) : 553 - 573
[3] Information rate of some classes of non-regular languages: Anautomata-theoretic approach
Cui, Cewei
Dang, Zhe
Fischer, Thomas R.
Ibarra, Oscar H.
INFORMATION AND COMPUTATION, 2017, 256 : 45 - 61

← 1 →