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.
EDBT 2026 Demo / reviewers in the wild / expert

Giovanna J. Lavado

dblp:31/10763 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2013
0000-0003-0826-6340ORCID · verified

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

Theory of computation · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 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 › finite automata
deterministic automata		 0.212013
Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata · Inf. Comput. 2013
Automata and formal languages › formal grammars
context-free grammar		 0.012013
Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata · Inf. Comput. 2013

Methods — techniques the papers use, named apart from their topics

parikh equivalence · 0.2nondeterministic automata · 0.2
YearPublicationVenuePosition
2013 Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata
Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki 0001
 Inf. Comput.1
2012 Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata
Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki 0001
 Developments in Language Theory1
2012 Parikh's Theorem and Descriptional Complexity
Giovanna J. Lavado, Giovanni Pighizzini
 SOFSEM1