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

Paul Franchi-Zannettacci

dblp:08/2826 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
0since 2021 · last 1982
—ORCID · none

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

Theory of computation · 6 · 1 first-authorDatabases, data management, data science and information retrieval · 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
2 papers
Automata and formal languages · 65% Computational complexity · 18% Logic in computer science · 18%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages › formal grammars
attribute grammars		 0.021982
On the Equivalence Problem for Attribute Systems · Inf. Control. 1982
On the Expressive Power of Attribute Grammars · FOCS 1980
Automata and formal languages
equivalence problem		 0.021982
On the Expressive Power of Attribute Grammars · FOCS 1980
On the Equivalence Problem for Attribute Systems · Inf. Control. 1982
Computational complexity › descriptive complexity
expressive power		 0.011980
On the Expressive Power of Attribute Grammars · FOCS 1980
Logic in computer science › rewriting › recursion schemes
recursive program schemes		 0.011980
On the Expressive Power of Attribute Grammars · FOCS 1980

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

attribute systems · 0.0
YearPublicationVenuePosition
1982 On the Equivalence Problem for Attribute Systems
Bruno Courcelle, Paul Franchi-Zannettacci
 Inf. Control.2
1982 An Extension to Trees of the Sardinas and Patterson Algorithm
Paul Franchi-Zannettacci
 Inf. Process. Lett.1
1982 Attribute Grammars and Recursive Program Schemes I
Bruno Courcelle, Paul Franchi-Zannettacci
 Theor. Comput. Sci.2
1982 Attribute Grammars and Recursive Program Schemes II
Bruno Courcelle, Paul Franchi-Zannettacci
 Theor. Comput. Sci.2
1980 On the Expressive Power of Attribute Grammars
abstract
We examine the possibility of translating an attribute system into a recursive program scheme taking derivation trees as arguments. This is possible if and only if the attribute system is strongly non-circular. The strong non circularity is decidable in polynomial time. Our recursive program schemes allow us to attack the equivalence problem for attribute systems and solve it in a special case properly including the case of purely synthesized systems.
Bruno Courcelle, Paul Franchi-Zannettacci
 FOCS2
1980 Automates a File
Bernard Vauquelin, Paul Franchi-Zannettacci
 Theor. Comput. Sci.2