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 条
  • [1] Learning stochastic deterministic regular languages
    Thollard, F
    Clark, A
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2004, 3264 : 248 - 259
  • [2] Polynomial Time MAT Learning of C-Deterministic Regular Formal Graph Systems
    Hara, Seiya
    Shoudai, Takayoshi
    2014 IIAI 3RD INTERNATIONAL CONFERENCE ON ADVANCED APPLIED INFORMATICS (IIAI-AAI 2014), 2014, : 204 - 211
  • [3] INFERENCE OF STOCHASTIC REGULAR GRAMMARS
    VANDERMUDE, A
    WALKER, A
    INFORMATION AND CONTROL, 1978, 38 (03): : 310 - 329
  • [4] Learning a subclass of regular patterns in polynomial time
    The Japanese Ministry of Education, Culture, Sports, Science and Technology; The Suginome Memorial Foundation, Japan (Springer Verlag):
  • [5] Learning a subclass of regular patterns in polynomial time
    Case, John
    Jain, Sanjay
    Reischuk, Ruediger
    Stephan, Frank
    Zeugmann, Thomas
    THEORETICAL COMPUTER SCIENCE, 2006, 364 (01) : 115 - 131
  • [6] Learning a subclass of regular patterns in polynomial time
    Case, J
    Jain, S
    Reischuk, R
    Stephan, F
    Zeugmann, T
    ALGORITHMIC LEARNING THEORY, PROCEEDINGS, 2003, 2842 : 234 - 246
  • [7] LEARNING CONTEXT-FREE GRAMMARS FROM STRUCTURAL DATA IN POLYNOMIAL-TIME
    SAKAKIBARA, Y
    THEORETICAL COMPUTER SCIENCE, 1990, 76 (2-3) : 223 - 242
  • [8] Context-Free Grammars for Deterministic Regular Expressions with Interleaving
    Mou, Xiaoying
    Chen, Haiming
    Li, Yeting
    THEORETICAL ASPECTS OF COMPUTING - ICTAC 2019, 2019, 11884 : 235 - 252
  • [9] Learning deterministic DEC grammars is learning rational numbers
    Adriaans, Pieter
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2006, 4201 : 320 - 326
  • [10] Learning commutative deterministic finite state automata in polynomial time
    Abe, N.
    Algorithmic Learning Theory, 1990,
12345