Towards Compact and Tractable Automaten-Based Representations of Time Granularities. - Ugo Dal Lago; Angelo Montanari; Gabriele Puppis (ICTCS, 2003)

Decidability of MSO Theories of Tree Structures. - Angelo Montanari; Gabriele Puppis (FSTTCS, 2004)

Time Granularities and Ultimately Periodic Automata. - Davide Bresolin; Angelo Montanari; Gabriele Puppis (JELIA, 2004)

Decidability of the Theory of the Totally Unbounded omega-Layered Structure. - Angelo Montanari; Gabriele Puppis (TIME, 2004)

On the relationships between theories of time granularity and the monadic second-order theory of one successor. - Angelo Montanari; Adriano Peron; Gabriele Puppis (J. Appl. Non Class. Logics, 2006)

A Contraction Method to Decide MSO Theories of Deterministic Trees. - Angelo Montanari; Gabriele Puppis (LICS, 2007)

On the Equivalence of Automaton-Based Representations of Time Granularities. - Ugo Dal Lago; Angelo Montanari; Gabriele Puppis (TIME, 2007)

Compact and tractable automaton-based representations of time granularities. - Ugo Dal Lago; Angelo Montanari; Gabriele Puppis (Theor. Comput. Sci., 2007)

A Decidable Spatial Logic with Cone-Shaped Cardinal Directions. - Angelo Montanari; Gabriele Puppis; Pietro Sala (CSL, 2009)

A theory of ultimately periodic languages and automata with an application to time granularity. - Davide Bresolin; Angelo Montanari; Gabriele Puppis (Acta Informatica, 2009)

Decidability of the interval temporal logic ABBar over the natural numbers - Angelo Montanari; Gabriele Puppis; Pietro Sala; Guido Sciavicco (CoRR, 2009)

Automata for Branching and Layered Temporal Structures: An Investigation into Regularities of Infinite Transition Systems - Gabriele Puppis (Springer, 2010)

What You Must Remember When Processing Data Words. - Michael Benedikt; Clemens Ley; Gabriele Puppis (AMW, 2010)

Automata vs. Logics on Data Words. - Michael Benedikt; Clemens Ley; Gabriele Puppis (CSL, 2010)

Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals. - Angelo Montanari; Gabriele Puppis; Pietro Sala (ICALP (2), 2010)

Positive higher-order queries. - Michael Benedikt; Gabriele Puppis; Huy Vu (PODS, 2010)

Decidability of the Interval Temporal Logic ABB over the Natural Numbers. - Angelo Montanari; Gabriele Puppis; Pietro Sala; Guido Sciavicco (STACS, 2010)

The Cost of Traveling between Languages. - Michael Benedikt; Gabriele Puppis; Cristian Riveros (ICALP (2), 2011)

Regular Languages of Words over Countable Linear Orderings. - Olivier Carton; Thomas Colcombet; Gabriele Puppis (ICALP (2), 2011)

Regular Repair of Specifications. - Michael Benedikt; Gabriele Puppis; Cristian Riveros (LICS, 2011)

On the Use of Guards for Logics with Data. - Thomas Colcombet; Clemens Ley; Gabriele Puppis (MFCS, 2011)

Bounded repairability for regular tree languages. - Gabriele Puppis; Cristian Riveros; Slawek Staworko (ICDT, 2012)

Which DTDs are streaming bounded repairable? - Pierre Bourhis; Gabriele Puppis; Cristian Riveros (ICDT, 2013)

Bounded repairability of word languages. - Michael Benedikt; Gabriele Puppis; Cristian Riveros (J. Comput. Syst. Sci., 2013)

Decidability of the Interval Temporal Logic $ mathsf{A bar{A}B bar{B}}$ over the Rationals. - Angelo Montanari; Gabriele Puppis; Pietro Sala (MFCS (1), 2014)

The per-character cost of repairing word languages. - Michael Benedikt; Gabriele Puppis; Cristian Riveros (Theor. Comput. Sci., 2014)

One-way Definability of Sweeping Transducer. - Félix Baschenis; Olivier Gauwin; Anca Muscholl; Gabriele Puppis (FSTTCS, 2015)

Querying Visible and Invisible Tables in the Presence of Integrity Constraints. - Michael Benedikt; Pierre Bourhis; Balder ten Cate; Gabriele Puppis (CoRR, 2015)

Logics with rigidly guarded data tests. - Thomas Colcombet; Clemens Ley; Gabriele Puppis (Log. Methods Comput. Sci., 2015)

A decidable weakening of Compass Logic based on cone-shaped cardinal directions. - Angelo Montanari; Gabriele Puppis; Pietro Sala (Log. Methods Comput. Sci., 2015)

The complexity of higher-order queries. - Michael Benedikt; Gabriele Puppis; Huy Vu (Inf. Comput., 2015)

Games, Automata, Logics, and Formal Verification (GandALF 2013). - Angelo Montanari; Gabriele Puppis; Tiziano Villa (Inf. Comput., 2015)

Which XML Schemas are Streaming Bounded Repairable? - Pierre Bourhis; Gabriele Puppis; Cristian Riveros (Theory Comput. Syst., 2015)

Minimizing Resources of Sweeping and Streaming String Transducers. - Félix Baschenis; Olivier Gauwin; Anca Muscholl; Gabriele Puppis (ICALP, 2016)

Querying Visible and Invisible Information. - Michael Benedikt; Pierre Bourhis; Balder ten Cate; Gabriele Puppis (LICS, 2016)

Walking on Data Words. - Amaldev Manuel; Anca Muscholl; Gabriele Puppis (Theory Comput. Syst., 2016)

Bounded Repairability for Regular Tree Languages. - Pierre Bourhis; Gabriele Puppis; Cristian Riveros; Slawek Staworko (ACM Trans. Database Syst., 2016)

Untwisting two-way transducers in elementary time. - Félix Baschenis; Olivier Gauwin; Anca Muscholl; Gabriele Puppis (LICS, 2017)

On the Decomposition of Finite-Valued Streaming String Transducers. - Paul Gallot; Anca Muscholl; Gabriele Puppis; Sylvain Salvati (STACS, 2017)

Origin-Equivalence of Two-Way Word Transducers Is in PSPACE. - Sougata Bose; Anca Muscholl; Vincent Penelle; Gabriele Puppis (FSTTCS, 2018)

Resynchronizing Classes of Word Relations. - María Emilia Descotte; Diego Figueira; Gabriele Puppis (ICALP, 2018)

An Algebraic Approach to MSO-Definability on Countable linear Orderings. - Olivier Carton; Thomas Colcombet; Gabriele Puppis (J. Symb. Log., 2018)

One-way definability of two-way word transducers. - Félix Baschenis; Olivier Gauwin; Anca Muscholl; Gabriele Puppis (Log. Methods Comput. Sci., 2018)

Equivalence of Finite-Valued Streaming String Transducers Is Decidable. - Anca Muscholl; Gabriele Puppis (ICALP, 2019)

On Synthesis of Resynchronizers for Transducers. - Sougata Bose; Shankara Narayanan Krishna; Anca Muscholl; Vincent Penelle; Gabriele Puppis (MFCS, 2019)

The Many Facets of String Transducers (Invited Talk). - Anca Muscholl; Gabriele Puppis (STACS, 2019)

The monitoring problem for timed automata. - Alejandro Grez; Filip Mazowiecki; Michal Pilipczuk; Gabriele Puppis; Cristian Riveros (CoRR, 2020)

One-way Resynchronizability of Word Transducers. - Sougata Bose; Shankara Narayanan Krishna; Anca Muscholl; Gabriele Puppis (FoSSaCS, 2021)

Inference from Visible Information and Background Knowledge. - Michael Benedikt; Pierre Bourhis; Balder ten Cate; Gabriele Puppis; Michael Vanden Boom (ACM Trans. Comput. Log., 2021)

Dynamic Data Structures for Timed Automata Acceptance. - Alejandro Grez; Filip Mazowiecki; Michal Pilipczuk; Gabriele Puppis; Cristian Riveros (Algorithmica, 2022)

The Logic of Prefixes and Suffixes is Elementary under Homogeneity*. - Dario Della Monica; Angelo Montanari; Gabriele Puppis; Pietro Sala (LICS, 2023)

The Logic of Prefixes and Suffixes is Elementary under Homogeneity. - Dario Della Monica; Angelo Montanari; Gabriele Puppis; Pietro Sala (CoRR, 2023)

Finite-valued Streaming String Transducers. - Emmanuel Filiot; Ismaël Jecker; Gabriele Puppis; Christof Löding; Anca Muscholl; Sarah Winter (TheoretiCS, 2025)