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

Jeannine Leguy

dblp:44/2828 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 1985
—ORCID · none

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

Theory of computation · 5 · 2 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
Automata and formal languages · 100%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages › formal language operations
morphisms
0.011983
On the Composition of Morphisms and Inverse Morphisms · ICALP 1983
Automata and formal languages › formal language operations
inverse homomorphism
0.011983
On the Composition of Morphisms and Inverse Morphisms · ICALP 1983
YearPublicationVenuePosition
1985 On the Usefulness of Bifaithful Rational Cones
Michel Latteux, Jeannine Leguy
Math. Syst. Theory2
1983 On the Composition of Morphisms and Inverse Morphisms
Michel Latteux, Jeannine Leguy
ICALP2
1982 Langages saturés et cones décroissants Langages et cones bifidèles
Jeannine Leguy
Acta Informatica1
1981 Rational Cone and Substitution
Jeannine Leguy
FCT1
1979 Une propriete de la famille GRE
Michel Latteux, Jeannine Leguy
FCT2