Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Antonio Cano Gómez

dblp:32/618 · also Antonio Cano · DBLP profile ↗
← Back
10ranked-venue papers
7as first author
0since 2021 · last 2013
0000-0002-6440-021XORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 8 · 6 first-authorArtificial intelligence and machine learning · 1Systems, architecture and hardware · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Logic in computer science · 56% Automata and formal languages · 44%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science › concurrency theory › trace theory
partial commutation		 0.212013
Regular languages and partial commutations · Inf. Comput. 2013
Automata and formal languages
regular languages		 0.212013
Regular languages and partial commutations · Inf. Comput. 2013
Logic in computer science › concurrency theory
trace theory		 0.012013
Regular languages and partial commutations · Inf. Comput. 2013
YearPublicationVenuePosition
2013 Regular languages and partial commutations
Antonio Cano Gómez, Giovanna Guaiana, Jean-Éric Pin
 Inf. Comput.1
2009 On locally reversible languages
Pedro García 0001, Manuel Vazquez de Parga, Antonio Cano Gómez, Damián López
 Theor. Comput. Sci.3
2008 When Does Partial Commutative Closure Preserve Regularity?
Antonio Cano Gómez, Giovanna Guaiana, Jean-Éric Pin
 ICALP (2)1
2008 A Robust Class of Regular Languages
Antonio Cano Gómez, Jean-Éric Pin
 MFCS1
2005 Inference Improvement by Enlarging the Training Set While Learning DFAs
Pedro García 0001, José Ruiz 0001, Antonio Cano Gómez, Gloria Inés Alvarez
 CIARP3
2005 Finite Automata and Unions of Regular Patterns with Bounded Constant Segments
Antonio Cano Gómez, Pedro García 0001
 CIAA1
2005 Is Learning RFSAs Better Than Learning DFAs?
Pedro García 0001, José Ruiz 0001, Antonio Cano Gómez, Gloria Inés Alvarez
 CIAA3
2004 Shuffle on positive varieties of languages
Antonio Cano Gómez, Jean-Éric Pin
 Theor. Comput. Sci.1
2003 On a Conjecture of Schnoebelen
Antonio Cano Gómez, Jean-Éric Pin
 Developments in Language Theory1
2003 Modeling micro-turbines on the distribution system using identification algorithms
abstract
To determine the potential impacts of micro-turbines on future distribution system, dynamic models of micro-turbines should be created, reduced in order, and scattered throughout test feeders. This paper presents the implementation of an efficient method for computing low order linear system models of micro-turbines from time domain simulations. The method is the Box-Jenkins algorithm for calculating the transfer function of a linear system from samples of its input and output.
Antonio Cano Gómez, Francisco Jurado 0002
 ETFA (2)1