Automata for Branching and Layered Temporal Structures: an investigation into regularities of infinite transition systems ‌ Puppis, G

A Contraction Method to Decide MSO Theories of Deterministic Trees ‌ Montanari, A, Puppis, G

Decidability of MSO Theories of Tree Structures ‌ Montanari, A, Puppis, G

Decidability of the Theory of the Totally Unbounded omega−Layered Structure ‌ Montanari, A, Puppis, G

Regular Languages of Words Over Countable Linear Orderings ‌ Carton, O, Colcombet, T, Puppis, G

Bounded reparability for regular tree languages ‌ Puppis, G, Riveros, C, Staworko, S

On the use of guards for logics with data ‌ Colcombet, T, Ley, C, Puppis, G

Positive Higher−Order Queries ‌ Benedikt, M, Puppis, G, Vu, H

Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals ‌ Montanari, A, Puppis, G, Sala, P

Decidability of the Interval Temporal Logic ABB Over the Natural Numbers ‌ Montanari, A, Puppis, G, Sala, P

The cost of traveling between languages ‌ Benedikt, M, Puppis, G, Riveros, C

Compact and Tractable Automaton−based Representations for Time Granularities ‌ Lago, U, Montanari, A, Puppis, G

A Decidable Spatial Logic with Cone−shaped Cardinal Directions ‌ Montanari, A, Puppis, G, Sala, P

The Cost of Traveling Between Languages ‌ Benedikt, M, Puppis, G, Riveros, C

Which DTDs are streaming repairable? ‌ Bourhis, P, Puppis, G, Riveros, C

Time Granularities and Ultimately Periodic Automata ‌ Bresolin, D, Montanari, A, Puppis, G

Automata vs. Logics on Data Words ‌ Benedikt, M, Ley, C, Puppis, G

A Theory of Ultimately Periodic Languages and Automata With an Application to Time Granularity ‌ Bresolin, D, Montanari, A, Puppis, G

Regular repair of specifications ‌ Benedikt, M, Puppis, G, Riveros, C

Automata vs. Logics on Data Words ‌ Benedikt, M, Ley, C, Puppis, G