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 条
  • [41] Learning rational Stochastic tree languages
    Denis, Francois
    Habrard, Amaury
    ALGORITHMIC LEARNING THEORY, PROCEEDINGS, 2007, 4754 : 242 - +
  • [42] Stochastic finite learning of the pattern languages
    Rossmanith, P
    Zeugmann, T
    MACHINE LEARNING, 2001, 44 (1-2) : 67 - 91
  • [43] Fuzzy ε-approximate regular languages and minimal deterministic fuzzy automata ε-accepting them
    Yang, Chao
    Li, Yongming
    FUZZY SETS AND SYSTEMS, 2021, 420 (420) : 72 - 86
  • [44] Stochastic versus deterministic features in learning models
    Stamatescu, IO
    ALTERNATIVE LOGICS: DO SCIENCES NEED THEM?, 2004, : 205 - 213
  • [45] Learning regular languages using nondeterministic finite automata
    Garcia, Pedro
    Vazquez de Parga, Manuel
    Alvarez, Gloria I.
    Ruiz, Jose
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2008, 5148 : 92 - +
  • [46] LEARNING REGULAR LANGUAGES OVER LARGE ORDERED ALPHABETS
    Mens, Irini-Eleftheria
    Maler, Oded
    LOGICAL METHODS IN COMPUTER SCIENCE, 2015, 11 (03)
  • [47] Synthesis of Supervisors Using Learning Algorithm of Regular Languages
    Kunihiko Hiraishi
    Discrete Event Dynamic Systems, 2001, 11 : 211 - 234
  • [48] Synthesis of supervisors using learning algorithm of regular languages
    Hiraishi, K
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2001, 11 (03): : 211 - 234
  • [49] Learning Regular Languages from Simple Positive Examples
    François Denis
    Machine Learning, 2001, 44 : 37 - 66
  • [50] Learning regular languages from simple positive examples
    Denis, F
    MACHINE LEARNING, 2001, 44 (1-2) : 37 - 66
12345