Universal automata and NFA learning-Reference-Cited by-同舟云学术

Universal automata and NFA learning

Published:2008-11 Issue:1-3 Volume:407 Page:192-202
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

García Pedro,Vázquez de Parga Manuel,Álvarez Gloria I.,Ruiz José

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference19 articles.

1. Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA;Abela,2004

2. G.I. Alvarez, J. Ruiz, A. Cano, P. García, Nondeterministic Regular Positive Negative Inference NRPNI, in: J.F. Díaz, C. Rueda, A. Buss (Eds.), XXXI CLEI 05, 2005, pp. 239–249

3. A note about minimal non-deterministic automata;Arnold;Bulletin of the EATCS,1970

4. C. Carrez, On the minimalization of non-deterministic automata, Laboratoire de Calcul de la Faculté des Sciences de L’Université de Lille, 1970

5. Beyond EDSM;Cicehello,2002

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Robust models to infer flexible nondeterministic finite automata;Journal of Computational Science;2024-07

2. On quotients of formal power series;Information and Computation;2022-05

3. Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference;Fundamenta Informaticae;2021-01-15

4. Generating Minimal Nondeterministic Finite Automata Using a Parallel Algorithm;2020 19th International Symposium on Parallel and Distributed Computing (ISPDC);2020-07

5. On Superlinear Speedups of a Parallel NFA Induction Algorithm;Parallel Computing: Technology Trends;2020-03-20