Manuel Vazquez de Parga

According to our database1, Manuel Vazquez de Parga authored at least 16 papers between 2003 and 2016.

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

2016
Minimal consistent DFA revisited.
Theor. Comput. Sci., 2016

A sufficient condition to polynomially compute a minimum separating DFA.
Inf. Sci., 2016

2015
DFA minimization: Double reversal versus split minimization algorithms.
Theor. Comput. Sci., 2015

A Split-Based Incremental Deterministic Automata Minimization Algorithm.
Theory Comput. Syst., 2015

2014
Efficient Deterministic Finite Automata Split-Minimization derived from Brzozowski's Algorithm.
Int. J. Found. Comput. Sci., 2014

2013
A polynomial double reversal minimization algorithm for deterministic finite automata.
Theor. Comput. Sci., 2013

2012
Polynomial characteristic sets for DFA identification.
Theor. Comput. Sci., 2012

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

2009
On locally reversible languages.
Theor. Comput. Sci., 2009

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

On the efficient construction of quasi-reversible automata for reversible languages.
Inf. Process. Lett., 2008

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

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

2005
A note about mergible states in large NFA.
Bull. EATCS, 2005

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

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


  Loading...