Learning stochastic deterministic regular languages

被引：0
|
作者：
Thollard, F
Clark, A
机构：
[1] Univ St Etienne, CH-1211 Geneva 4, Switzerland
[2] Univ Geneva, TIM, ISSCO, CH-1211 Geneva 4, Switzerland
来源：
GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS | 2004年 / 3264卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We propose in this article a new practical algorithm for inferring mu-distinguishable stochastic deterministic regular languages. We prove that this algorithm will infer, with high probability, an automaton isomorphic to the target when given a polynomial number of examples. We discuss the links between the error function used to evaluate the inferred model and the learnability of the model class in a PAC like framework.
引用
收藏
页码：248 / 259
页数：12
相关论文
共 50 条
  • [1] DETERMINISTIC REGULAR LANGUAGES
    BRUGGEMANNKLEIN, A
    WOOD, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 577 : 173 - 184
  • [2] Learning regular languages using non deterministic finite automata
    Denis, F
    Lemay, A
    Terlutte, A
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, 2000, 1891 : 39 - 50
  • [3] Regular closure of deterministic languages
    Ruhr University Bochum, Bochum, Germany
    不详
    SIAM J Comput, 1 (81-102):
  • [4] Regular closure of deterministic languages
    Bertsch, E
    Nederhof, MJ
    SIAM JOURNAL ON COMPUTING, 1999, 29 (01) : 81 - 102
  • [5] DETERMINISTIC ACCEPTORS OF REGULAR FUZZY LANGUAGES
    THOMASON, MG
    MARINOS, PN
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1974, MC 4 (02): : 228 - 230
  • [6] Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages
    Kawasaki, Yoshito
    Hendrian, Diptarama
    Yoshinaka, Ryo
    Shinohara, Ayumi
    SOFSEM 2024: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2024, 14519 : 340 - 354
  • [7] Learning deterministic regular grammars from stochastic samples in polynomial time
    Carrasco, RC
    Oncina, J
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1999, 33 (01): : 1 - 19
  • [8] On regular tree languages and deterministic pushdown automata
    Jan Janoušek
    Bořivoj Melichar
    Acta Informatica, 2009, 46 : 533 - 547
  • [9] On regular tree languages and deterministic pushdown automata
    Janousek, Jan
    Melichar, Borivoj
    ACTA INFORMATICA, 2009, 46 (07) : 533 - 547
  • [10] Generalizations of 1-deterministic regular languages
    Han, Yo-Sub
    Wood, Derick
    INFORMATION AND COMPUTATION, 2008, 206 (9-10) : 1117 - 1125
12345