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

Alan J. Cain

dblp:26/3553 · DBLP profile ↗
← Back
8ranked-venue papers
5as first author
0since 2021 · last 2020
0000-0002-0706-1354ORCID · verified

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

Theory of computation · 8 · 5 first-author

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
3 papers
Automata and formal languages · 38% Computational complexity · 22% Combinatorics and discrete mathematics · 22%

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

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics
binary relation		 0.412020
A language hierarchy of binary relations · Inf. Comput. 2020
Computational complexity › complexity classes
language hierarchy		 0.412020
A language hierarchy of binary relations · Inf. Comput. 2020
Automata and formal languages › string rewriting
complete rewriting systems		 0.312017
On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids · Inf. Comput. 2017
Automata and formal languages › semigroup theory
monoids		 0.312017
On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids · Inf. Comput. 2017
Logic in computer science
rewriting systems		 0.312017
On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids · Inf. Comput. 2017
Automata and formal languages › semigroup theory
automatic presentation		 0.112009
Automatic presentations for semigroups · Inf. Comput. 2009
Logic in computer science › model theory
automatic structures		 0.112009
Automatic presentations for semigroups · Inf. Comput. 2009
Automata and formal languages
semigroup theory		 0.112009
Automatic presentations for semigroups · Inf. Comput. 2009
YearPublicationVenuePosition
2020 A language hierarchy of binary relations
Tara Brough, Alan J. Cain
 Inf. Comput.2
2019 Context-Free Word Problem Semigroups
Tara Brough, Alan J. Cain, Markus Pfeiffer
 DLT2
2017 On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids
Alan J. Cain, Robert D. Gray, António Malheiro
 Inf. Comput.1
2017 Automaton semigroups: New constructions results and examples of non-automaton semigroups
Tara Brough, Alan J. Cain
 Theor. Comput. Sci.2
2010 Automatic Presentations and Semigroup Constructions
Alan J. Cain, Graham P. Oliver, Nikola Ruskuc, Richard M. Thomas
 Theory Comput. Syst.1
2009 Automatic presentations for semigroups
Alan J. Cain, Graham P. Oliver, Nikola Ruskuc, Richard M. Thomas
 Inf. Comput.1
2009 Automaton semigroups
Alan J. Cain
 Theor. Comput. Sci.1
2008 Automatic Presentations for Cancellative Semigroups
Alan J. Cain, Graham P. Oliver, Nikola Ruskuc, Richard M. Thomas
 LATA1