Antonio Cano Gómez

Orcid: 0000-0002-6440-021X

According to our database1, Antonio Cano Gómez authored at least 21 papers between 2000 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Fault analysis in clustered microgrids utilizing SVM-CNN and differential protection.
Appl. Soft Comput., 2024

2015
On fixed points of the lower set operator.
Int. J. Algebra Comput., 2015

Varieties of Unranked Tree Languages.
CoRR, 2015

2013
Regular languages and partial commutations.
Inf. Comput., 2013

2011
Varieties of Languages and Frontier Check.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

2010
Inferring Regular Trace Languages from Positive and Negative Samples.
Proceedings of the Grammatical Inference: Theoretical Results and Applications, 2010

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

2008
A Robust Class of Regular Languages.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Learning Commutative Regular Languages.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2008

When Does Partial Commutative Closure Preserve Regularity?
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

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

Finite Automata and Unions of Regular Patterns with Bounded Constant Segments.
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
Shuffle on positive varieties of languages.
Theor. Comput. Sci., 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
Modeling micro-turbines on the distribution system using identification algorithms.
Proceedings of 9th IEEE International Conference on Emerging Technologies and Factory Automation, 2003

On a Conjecture of Schnoebelen.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

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

2001
A Hybrid Approach to the Development of Dialogue Systems directed by Semantics.
Proceedings of the SIGDIAL 2001 Workshop, 2001

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


  Loading...