José Ruiz

Affiliations:
  • Universidad Politécnica de Valencia, Spain


According to our database1, José Ruiz authored at least 22 papers between 1994 and 2011.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
From regular expressions to smaller NFAs.
Theor. Comput. Sci., 2011

2010
Learning Automata Teams.
Proceedings of the Grammatical Inference: Theoretical Results and Applications, 2010

2008
Universal automata and NFA learning.
Theor. Comput. Sci., 2008

Learning Regular Languages Using Nondeterministic Finite Automata.
Proceedings of the Implementation and Applications of Automata, 2008

2006
Learning in varieties of the form V<sup>*</sup>LI from positive data.
Theor. Comput. Sci., 2006

A Family of Algorithms for Non Deterministic Regular Languages Inference.
Proceedings of the Implementation and Application of Automata, 2006

A Merging States Algorithm for Inference of <i>RFSAs</i>.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2006

2005
Is Learning RFSAs Better Than Learning DFAs?.
Proceedings of the Implementation and Application of Automata, 2005

Inference Improvement by Enlarging the Training Set While Learning DFAs.
Proceedings of the Progress in Pattern Recognition, 2005

2004
Learning k-Testable and k-Piecewise Testable Languages from Positive Data.
Grammars, 2004

A Note on Minimal Cover-Automata for Finite Languages.
Bull. EATCS, 2004

Detection of Functional Motifs in Biosequences: A Grammatical Inference Approach.
Proceedings of the 5th Annual Spanish Bioinformatics Conference, Barcelona, Catalonia, 2004

Running FCRPNI in Efficient Time for Piecewise and Right Piecewise Testable Languages.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2004

2003
Bilateral locally testable languages.
Theor. Comput. Sci., 2003

Threshold Locally Testable Languages in Strict Sense.
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2002
Inferring Subclasses of Regular Languages Faster Using RPNI and Forbidden Configurations.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2002

2000
Right and left locally testable languages.
Theor. Comput. Sci., 2000

A Comparative Study of Two Algorithms for Automata Identification.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2000

1999
Right and left strongly locally testable semigroups and languages.
Proceedings of the Developments in Language Theory, 1999

1998
Locally Threshold Testable Languages in Strict Sense: Application to the Inference Problem.
Proceedings of the Grammatical Inference, 4th International Colloquium, 1998

1996
Learning k-piecewise testable languages from positive data.
Proceedings of the Grammatical Inference: Learning Syntax from Sentences, 1996

1994
The Algorithms RT and k-TTI: a First Comparison.
Proceedings of the Grammatical Inference and Applications, Second International Colloquium, 1994


  Loading...