Identifying regular languages in polynomial time (1992) [21 citations — 5 self]
Download:
by Pedro Garcia
Advances in Structural and Syntactic Pattern Recognition, volume 5 of Series in Machine Perception and Artificial Intelligence
ftp://altea.dlsi.ua.es/people/oncina/articulos/asspr1992.pdf
Add To MetaCart
Abstract:
The regular languages are commonly used as models in Syntactical Pattern Recognition tasks. A wide variety of inference algorithms have been developed to learn these models but usually these algorithms only make use of positive information, eventhough the negative is also available. In this paper we present an algorithm that always obtains a deterministic automaton compatible with the positive and negative data, lhat can identify in the limit any regular language and works in a polynomial lime. Some experiments are performed to show its behaviour. 1.
Citations
| 673 | Language identification in the limit – Gold - 1967 |
| 271 | Inductive inference: Theory and methods – Angluin, Smith - 1983 |
| 183 | Complexity of automaton identification from given data – Gold - 1978 |
| 180 | Syntactic pattern recognition and applications – Fu - 1982 |
| 91 | Inferring Regular Languages in Polynomial Update Time,” Pattern Recognition and Image Analysis – Oncina, García - 1992 |
| 37 | Syntactic Pattern Recognition: An introduction – Gonzalez, Thomason - 1978 |
| 17 | Grammatical Inference – Miclet - 1990 |
| 3 | Grammatical Inference: Introduction and Survey". parts 1 and 2 – Fu, Booth - 1975 |
| 1 | Un Algoritmo de inferencia de Lenguajes Regulares Usando Dams Positivos y Negativos". IV Simposium Nacional de Reconocimiento de Formas y Anfdisis de Imagenes – Garcfa - 1990 |
