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 VLDB 2026 / reviewers in the wild / expert

Anne Dicky

dblp:30/3890 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2015
—ORCID · none

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

Theory of computation · 5 · 3 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
1 paper
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Logic in computer science
algebraic characterization		 0.011989
An Algebraic Characterization of Transition System Equivalences · Inf. Comput. 1989
YearPublicationVenuePosition
2015 Two-way Automata and Regular Languages of Overlapping Tiles
abstract
We consider classes of languages of overlapping tiles, i.e., subsets of the McAlister monoid: the class REG of languages definable by Kleene’s regular expressions, the class MSO of languages definable by formulas of monadic second-order logic, and th
Anne Dicky, David Janin
 Fundam. Informaticae1
2014 Embedding Finite and Infinite Words into Overlapping Tiles - (Short Paper)
Anne Dicky, David Janin
 Developments in Language Theory1
1993 Equivalences and Preorders of Transition Systems
André Arnold, Anne Dicky
 MFCS2
1989 An Algebraic Characterization of Transition System Equivalences
André Arnold, Anne Dicky
 Inf. Comput.2
1986 An algebraic and algorithmic method for analysing transition systems
Anne Dicky
 Theor. Comput. Sci.1