The Algorithms RT and k-TTI: a First Comparison. - José Ruiz 001; Pedro García 001 (ICGI, 1994)

Learning k-piecewise testable languages from positive data. - José Ruiz 001; Pedro García 001 (ICGI, 1996)

Locally Threshold Testable Languages in Strict Sense: Application to the Inference Problem. - José Ruiz 001; Salvador España Boquera; Pedro García 001 (ICGI, 1998)

Right and left strongly locally testable semigroups and languages. - José Ruiz 001; Pedro García 001 (Developments in Language Theory, 1999)

A Comparative Study of Two Algorithms for Automata Identification. - Pedro García 001; Antonio Cano; José Ruiz 001 (ICGI, 2000)

Right and left locally testable languages. - Pedro García 001; José Ruiz 001 (Theor. Comput. Sci., 2000)

Inferring Subclasses of Regular Languages Faster Using RPNI and Forbidden Configurations. - Antonio Cano; José Ruiz 001; Pedro García 001 (ICGI, 2002)

Threshold Locally Testable Languages in Strict Sense. - Pedro García 001; José Ruiz 001 (Grammars and Automata for String Processing, 2003)

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

Running FCRPNI in Efficient Time for Piecewise and Right Piecewise Testable Languages. - Antonio Cano; José Ruiz 001; Pedro García 001 (ICGI, 2004)

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 on Minimal Cover-Automata for Finite Languages. - Pedro García 001; José Ruiz 001 (Bull. EATCS, 2004)

Learning k-Testable and k-Piecewise Testable Languages from Positive Data. - Pedro García 001; José Ruiz 001 (Grammars, 2004)

Inference Improvement by Enlarging the Training Set While Learning DFAs. - Pedro García 001; José Ruiz 001; Antonio Cano; Gloria Inés Alvarez (CIARP, 2005)

Is Learning RFSAs Better Than Learning DFAs?. - Pedro García 001; José Ruiz 001; Antonio Cano; Gloria Inés Alvarez (CIAA, 2005)

A Merging States Algorithm for Inference of RFSAs. - Gloria Inés Alvarez; Pedro García 001; José Ruiz 001 (ICGI, 2006)

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

Learning in varieties of the form V*LI from positive data. - Pedro García 001; José Ruiz 001 (Theor. Comput. Sci., 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)

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

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

From regular expressions to smaller NFAs. - Pedro García 001; Damián López; José Ruiz 001; Gloria Inés Alvarez (Theor. Comput. Sci., 2011)