A Comparative Study of Two Algorithms for Automata Identification

Garcia, Pedro Castillo; Cano, Antonio; Ruiz, José

doi:10.1007/978-3-540-45257-7_10

Cited by 10 publications

(5 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We have revised the Trakhtenbrot and Barzdin (TB), Gold, RPNI and Lang algorithms. As can be seen in [3], the rst two are in fact the same, while the rst description that Lang provides of the TB algorithm agrees with it only when the sample is uniformly complete. The extension he gives to obtain consistent hypotheses is in fact the RPNI algorithm.…”

Section: Discussionmentioning

confidence: 70%

“…Otherwise, p and q are not distinguishable in A. For a detailed description of the procedure distinguishable(p, q, A), the reader is referred to [3].…”

Section: The Trakhtenbrot and Barzdin Algorithmmentioning

confidence: 99%

“…For a better understanding of Gold's algorithm the reader is referred to [3] in which it is described as a procedure of merging states in the prex Moore machine of the sample.…”

Section: The Trakhtenbrot and Barzdin Algorithmmentioning

confidence: 99%

See 2 more Smart Citations

A Survey of State Merging Strategies for DFA Identification in the Limit

Tîrnăucă¹

2018

triangle

View full text Add to dashboard Cite

Identication of deterministic nite automata (DFAs) has an extensive history, both in passive learning and in active learning. Intractability results by Gold [5] and Angluin [1] show that nding the smallest automaton consistent with a set of accepted and rejected strings is NP-complete. Nevertheless, a lot of work has been done on learning DFAs from examples within specic heuristics, starting with Trakhtenbrot and Barzdin's algorithm [15], rediscovered and applied to the discipline of grammatical inference by Gold [5]. Many other algorithms have been developed, the convergence of most of which is based on characteristic sets: RPNI (Regular Positive and Negative Inference) by J. Oncina and P. García [11, 12], Traxbar by K. Lang [8], EDSM (Evidence Driven State Merging), Windowed EDSM and Blue- Fringe EDSM by K. Lang, B. Pearlmutter and R. Price [9], SAGE (Self-Adaptive Greedy Estimate) by H. Juillé [7], etc. This paper provides a comprehensive study of the most important state merging strategies developed so far.

show abstract

Section: Discussionmentioning

confidence: 70%

“…Otherwise, p and q are not distinguishable in A. For a detailed description of the procedure distinguishable(p, q, A), the reader is referred to [3].…”

Section: The Trakhtenbrot and Barzdin Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

A Survey of State Merging Strategies for DFA Identification in the Limit

Tîrnăucă¹

2018

triangle

View full text Add to dashboard Cite

show abstract

“…Además, mostraron que si esta información está disponible, el problema de inferencia es tratable. Se sabe que los algoritmos de Gold y Trakhtenbrot funcionan de forma similar, aunque utilizan representaciones muy diferentes de la información (García et al, 2000).…”

unclassified

Comparación de dos algoritmos recientes para inferencia gramatical de lenguajes regulares mediante autómatas no deterministas

Alvarez¹,

Ruiz²,

Garcia³

2011

inycomp

View full text Add to dashboard Cite

El desarrollo de nuevos algoritmos, que resulten convergentes y eficientes, es un paso necesario para un uso provechoso de la inferencia gramatical en la solución de problemas reales y de mayor tamaño. En este trabajo se presentan dos algoritmos llamados DeLeTe2 y MRIA, que implementan la inferencia gramatical por medio de autómatas no deterministas, en contraste con los algoritmos más comúnmente empleados, los cuales utilizan autómatas deterministas. Se consideran las ventajas y desventajas de este cambio en el modelo de representación, mediante la descripción detallada y la comparación de los dos algoritmos de inferencia con respecto al enfoque utilizado en su implementación, a su complejidad computacional, a sus criterios de terminación y a su desempeño sobre un cuerpo de datos sintéticos.

show abstract

“…Si M ′ es consistente con la muestra de entrada, se retorna como respuesta, si no se retorna elárbol de prefijos de Moore inicial. Una descripción más profunda de este algoritmo se puede encontrar en [GCR00].…”

Section: Algoritmos De Gold Y Delete2unclassified

Estudio de la mezcla de estados determinista y no determinista en el diseño de algoritmos para inferencia gramatical de lenguajes regulares.

Vargas¹,

Inés²

View full text Add to dashboard Cite

A Comparative Study of Two Algorithms for Automata Identification

Cited by 10 publications

References 2 publications

A Survey of State Merging Strategies for DFA Identification in the Limit

A Survey of State Merging Strategies for DFA Identification in the Limit

Comparación de dos algoritmos recientes para inferencia gramatical de lenguajes regulares mediante autómatas no deterministas

Estudio de la mezcla de estados determinista y no determinista en el diseño de algoritmos para inferencia gramatical de lenguajes regulares.

Contact Info

Product

Resources

About