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 条
  • [21] Learning of Regular ω-Tree Languages
    Jayasrirani, M.
    Begam, M. H.
    Thomas, D. G.
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2008, 5278 : 295 - +
  • [22] Learning Regular Omega Languages
    Angluin, Dana
    Fisman, Dana
    ALGORITHMIC LEARNING THEORY (ALT 2014), 2014, 8776 : 125 - 139
  • [23] Learning regular omega languages
    Angluin, Dana
    Fisman, Dana
    THEORETICAL COMPUTER SCIENCE, 2016, 650 : 57 - 72
  • [24] Supervisory control of deterministic Petri nets with regular specification languages
    Kumar, R
    Holloway, LE
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1996, 41 (02) : 245 - 249
  • [25] Most Complex Deterministic Union-Free Regular Languages
    Brzozowski, Janusz A.
    Davies, Sylvie
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2018, 2018, 10952 : 37 - 48
  • [26] An algebraic characterization of deterministic regular languages over infinite alphabets
    Francez, N
    Kaminski, M
    THEORETICAL COMPUTER SCIENCE, 2003, 306 (1-3) : 155 - 175
  • [27] Deterministic weak-and-marked Petri net languages are regular
    Gaubert, S
    Giua, A
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1996, 41 (12) : 1802 - 1803
  • [28] Identification with probability one of stochastic deterministic linear languages
    de la Higuera, C
    Oncina, J
    ALGORITHMIC LEARNING THEORY, PROCEEDINGS, 2003, 2842 : 247 - 258
  • [29] Learning of regular bi-ω languages
    Thomas, DG
    Begam, MH
    Subramanian, KG
    Gnanasekaran, S
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, 2002, 2484 : 283 - 292
  • [30] Learning regular languages using RFSAs
    Denis, F
    Lemay, A
    Terlutte, A
    THEORETICAL COMPUTER SCIENCE, 2004, 313 (02) : 267 - 294
12345