Bilateral locally testable languages. - Pedro García 001; José Ruiz 001; Manuel Vazquez de Parga (Theor. Comput. Sci., 2003)

Detection of Functional Motifs in Biosequences: A Grammatical Inference Approach. - Damián López; Antonio Cano; Manuel Vazquez de Parga; Belén Calles; José M. Sempere; Tomás Pérez; José Ruiz 001; Pedro García 001 (Spanish Bioinformatics Conference, 2004)

A note about mergible states in large NFA. - Pedro García 001; Manuel Vazquez de Parga (Bull. EATCS, 2005)

A Family of Algorithms for Non Deterministic Regular Languages Inference. - Manuel Vazquez de Parga; Pedro García 001; José Ruiz 001 (CIAA, 2006)

Learning Regular Languages Using Nondeterministic Finite Automata. - Pedro García 001; Manuel Vazquez de Parga; Gloria Inés Alvarez; José Ruiz 001 (CIAA, 2008)

On the efficient construction of quasi-reversible automata for reversible languages. - Pedro García 001; Manuel Vazquez de Parga; Damián López (Inf. Process. Lett., 2008)

Universal automata and NFA learning. - Pedro García 001; Manuel Vazquez de Parga; Gloria Inés Alvarez; José Ruiz 001 (Theor. Comput. Sci., 2008)

On locally reversible languages. - Pedro García 001; Manuel Vazquez de Parga; Antonio Cano; Damián López (Theor. Comput. Sci., 2009)

Learning Automata Teams. - Pedro García 001; Manuel Vazquez de Parga; Damián López; José Ruiz 001 (ICGI, 2010)

Polynomial characteristic sets for DFA identification. - Pedro García 001; Damián López; Manuel Vazquez de Parga (Theor. Comput. Sci., 2012)

A polynomial double reversal minimization algorithm for deterministic finite automata. - Manuel Vazquez de Parga; Pedro García 001; Damián López (Theor. Comput. Sci., 2013)

Efficient Deterministic Finite Automata Split-Minimization derived from Brzozowski's Algorithm. - Pedro García 001; Damián López; Manuel Vazquez de Parga (Int. J. Found. Comput. Sci., 2014)

A Split-Based Incremental Deterministic Automata Minimization Algorithm. - Pedro García 001; Manuel Vazquez de Parga; Jairo Andrés Velasco; Damián López (Theory Comput. Syst., 2015)

DFA minimization: Double reversal versus split minimization algorithms. - Pedro García 001; Damián López; Manuel Vazquez de Parga (Theor. Comput. Sci., 2015)

A sufficient condition to polynomially compute a minimum separating DFA. - Manuel Vazquez de Parga; Pedro García 001; Damián López (Inf. Sci., 2016)

Minimal consistent DFA revisited. - Manuel Vazquez de Parga; Pedro García 001; Damián López (Theor. Comput. Sci., 2016)