Learning deterministic regular grammars from stochastic samples in polynomial time

被引：71
|
作者：
Carrasco, RC [1 ]
Oncina, J [1 ]
机构：
[1] Univ Alicante, Dept Lenguajes & Sistemas Informat, Alicante 03071, Spain
来源：
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS | 1999年 / 33卷 / 01期
关键词：
D O I：
10.1051/ita:1999102
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, the identification of stochastic regular languages is addressed. For this purpose, we propose a class of algorithms which allow for the identification of the structure of the minimal stochastic automaton generating the language. It is shown that the time needed grows only linearly with the size of the sample set and a measure of the complexity of the task is provided. Experimentally, our implementation proves very fast for application purposes.
引用
收藏
页码：1 / 19
页数：19
相关论文
共 50 条
  • [31] Learning a Subclass of Deterministic Regular Expression with Counting
    Wang, Xiaofan
    Chen, Haiming
    KNOWLEDGE SCIENCE, ENGINEERING AND MANAGEMENT, KSEM 2019, PT I, 2019, 11775 : 341 - 348
  • [32] Learning Restricted Deterministic Regular Expressions with Counting
    Wang, Xiaofan
    Chen, Haiming
    WEB INFORMATION SYSTEMS ENGINEERING - WISE 2019, 2019, 11881 : 98 - 114
  • [33] Optimal Controller for Uncertain Stochastic Polynomial Systems with Deterministic Disturbances
    Basin, Michael
    Calderon-Alvarez, Dario
    2009 AMERICAN CONTROL CONFERENCE, VOLS 1-9, 2009, : 778 - 783
  • [34] Optimal controller for uncertain stochastic polynomial systems with deterministic disturbances
    Basin, Michael
    Calderon-Alvarez, Dario
    INTERNATIONAL JOURNAL OF CONTROL, 2009, 82 (08) : 1435 - 1447
  • [35] Polynomial-time identification of an extension of very simple grammars from positive data
    Yoshinaka, Ryo
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2006, 4201 : 45 - 58
  • [36] SOLAR FIBER BURSTS DYNAMIC: REGULAR, DETERMINISTIC CHAOS OR STOCHASTIC
    Cuendias Perez, L.
    Mendez Berhondo, A. L.
    Diaz Rodriguez, A. K.
    REVISTA CUBANA DE FISICA, 2015, 32 (02): : 109 - 110
  • [37] Time reduction of stochastic parsing with stochastic context-free grammars
    Sánchez, JA
    Benedí, JM
    PATTERN RECOGNITION AND IMAGE ANALYSIS, PT 2, PROCEEDINGS, 2005, 3523 : 163 - 171
  • [38] ORDER INDEPENDENT NCE GRAMMARS RECOGNIZED IN POLYNOMIAL-TIME
    JEFFS, J
    INFORMATION PROCESSING LETTERS, 1991, 39 (03) : 161 - 164
  • [39] Learning and parsing stochastic unification-based grammars
    Johnson, M
    LEARNING THEORY AND KERNEL MACHINES, 2003, 2777 : 671 - 683
  • [40] Stochastic Context-Free Grammars, Regular Languages, and Newton's Method
    Etessami, Kousha
    Stewart, Alistair
    Yannakakis, Mihalis
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II, 2013, 7966 : 199 - 211
12345