default search action
Manuel Vazquez de Parga
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j12]Manuel Vazquez de Parga, Pedro García, Damián López
:
A sufficient condition to polynomially compute a minimum separating DFA. Inf. Sci. 370-371: 204-220 (2016) - [j11]Manuel Vazquez de Parga, Pedro García, Damián López
Minimal consistent DFA revisited. Theor. Comput. Sci. 647: 43-49 (2016) - 2015
- [j10]Pedro García, Manuel Vazquez de Parga, Jairo Andrés Velasco, Damián López
A Split-Based Incremental Deterministic Automata Minimization Algorithm. Theory Comput. Syst. 57(2): 319-336 (2015) - [j9]Pedro García, Damián López
DFA minimization: Double reversal versus split minimization algorithms. Theor. Comput. Sci. 583: 78-85 (2015) - 2014
- [j8]Pedro García, Damián López
Efficient Deterministic Finite Automata Split-Minimization derived from Brzozowski's Algorithm. Int. J. Found. Comput. Sci. 25(6): 679-696 (2014) - 2013
- [j7]Manuel Vazquez de Parga, Pedro García, Damián López
A polynomial double reversal minimization algorithm for deterministic finite automata. Theor. Comput. Sci. 487: 17-22 (2013) - 2012
- [j6]Pedro García, Damián López
Polynomial characteristic sets for DFA identification. Theor. Comput. Sci. 448: 41-46 (2012) - 2010
- [c4]Pedro García, Manuel Vazquez de Parga, Damián López
Learning Automata Teams. ICGI 2010: 52-65
2000 – 2009
- 2009
- [j5]Pedro García, Manuel Vazquez de Parga, Antonio Cano, Damián López
On locally reversible languages. Theor. Comput. Sci. 410(47-49): 4961-4974 (2009) - 2008
- [j4]Pedro García, Manuel Vazquez de Parga, Damián López
On the efficient construction of quasi-reversible automata for reversible languages. Inf. Process. Lett. 107(1): 13-17 (2008) - [j3]Pedro García, Manuel Vazquez de Parga, Gloria Inés Alvarez, José Ruiz:
Universal automata and NFA learning. Theor. Comput. Sci. 407(1-3): 192-202 (2008) - [c3]Pedro García, Manuel Vazquez de Parga, Gloria Inés Alvarez, José Ruiz:
Learning Regular Languages Using Nondeterministic Finite Automata. CIAA 2008: 92-101 - 2006
- [c2]Manuel Vazquez de Parga, Pedro García, José Ruiz:
A Family of Algorithms for Non Deterministic Regular Languages Inference. CIAA 2006: 265-274 - 2005
- [j2]Pedro García, Manuel Vazquez de Parga:
A note about mergible states in large NFA. Bull. EATCS 87: 181-184 (2005) - 2004
- [c1]Damián López, Antonio Cano, Manuel Vazquez de Parga, Belén Calles, José M. Sempere, Tomás Pérez, José Ruiz, Pedro García:
Detection of Functional Motifs in Biosequences: A Grammatical Inference Approach. Spanish Bioinformatics Conference 2004: 72-75 - 2003
- [j1]Pedro García, José Ruiz, Manuel Vazquez de Parga:
Bilateral locally testable languages. Theor. Comput. Sci. 299(1-3): 775-783 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: