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 D. Logan

dblp:259/3154 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0003-1767-6798ORCID · corroborated

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

Theory of computation · 2 · 1 since 2021

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
1 paper
Combinatorics and discrete mathematics · 40% Automata and formal languages · 40% Computational complexity · 20%

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

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics › group theory
free groups		 0.412020
The Post Correspondence Problem and Equalisers for Certain Free Group and Monoid Morphisms · ICALP 2020
Automata and formal languages › semigroup theory
free monoids		 0.412020
The Post Correspondence Problem and Equalisers for Certain Free Group and Monoid Morphisms · ICALP 2020
Combinatorics and discrete mathematics
group theory		 0.412020
The Post Correspondence Problem and Equalisers for Certain Free Group and Monoid Morphisms · ICALP 2020
Automata and formal languages › semigroup theory
monoid theory		 0.412020
The Post Correspondence Problem and Equalisers for Certain Free Group and Monoid Morphisms · ICALP 2020
Computational complexity › decidability
post correspondence problem		 0.412020
The Post Correspondence Problem and Equalisers for Certain Free Group and Monoid Morphisms · ICALP 2020
YearPublicationVenuePosition
2021 Variations on the Post Correspondence Problem for Free Groups
Laura Ciobanu, Alan D. Logan
 DLT2
2020 The Post Correspondence Problem and Equalisers for Certain Free Group and Monoid Morphisms
abstract
A marked free monoid morphism is a morphism for which the image of each generator starts with a different letter, and immersions are the analogous maps in free groups. We show that the (simultaneous) PCP is decidable for immersions of free groups, and provide an algorithm to compute bases for the sets, called equalisers, on which the immersions take the same values. We also answer a question of Stallings about the rank of the equaliser. Analogous results are proven for marked morphisms of free monoids.
Laura Ciobanu, Alan D. Logan
 ICALP2