Gabriele Puppis

Proceedings of the Foundations of Software Science and Computation Structures, 2021

2020

The monitoring problem for timed automata.

[BibT_eX]

[DOI]

CoRR, 2020

2019

The Many Facets of String Transducers (Invited Talk).

[BibT_eX]

[DOI]

Shankara Narayanan Krishna

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

On Synthesis of Resynchronizers for Transducers.

[BibT_eX]

[DOI]

Sougata Bose

Vincent Penelle

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Equivalence of Finite-Valued Streaming String Transducers Is Decidable.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

One-way definability of two-way word transducers.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2018

An Algebraic Approach to MSO-Definability on Countable linear Orderings.

[BibT_eX]

[DOI]

Olivier Carton

J. Symb. Log., 2018

Resynchronizing Classes of Word Relations.

[BibT_eX]

[DOI]

María Emilia Descotte

Diego Figueira

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Origin-Equivalence of Two-Way Word Transducers Is in PSPACE.

[BibT_eX]

[DOI]

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

On the Decomposition of Finite-Valued Streaming String Transducers.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Untwisting two-way transducers in elementary time.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

Bounded Repairability for Regular Tree Languages.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2016

Walking on Data Words.

[BibT_eX]

[DOI]

Amaldev Manuel

Theory Comput. Syst., 2016

Querying Visible and Invisible Information.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Minimizing Resources of Sweeping and Streaming String Transducers.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Which XML Schemas are Streaming Bounded Repairable?

[BibT_eX]

[DOI]

Pierre Bourhis

Theory Comput. Syst., 2015

Games, Automata, Logics, and Formal Verification (GandALF 2013).

[BibT_eX]

[DOI]

Tiziano Villa

Inf. Comput., 2015

The complexity of higher-order queries.

[BibT_eX]

[DOI]

Huy Vu

Inf. Comput., 2015

A decidable weakening of Compass Logic based on cone-shaped cardinal directions.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2015

Logics with rigidly guarded data tests.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2015

Querying Visible and Invisible Tables in the Presence of Integrity Constraints.

[BibT_eX]

[DOI]

CoRR, 2015

One-way Definability of Sweeping Transducer.

[BibT_eX]

[DOI]

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014

The per-character cost of repairing word languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Decidability of the Interval Temporal Logic $\mathsf{A\bar{A}B\bar{B}}$ over the Rationals.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

Bounded repairability of word languages.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

Which DTDs are streaming bounded repairable?

[BibT_eX]

[DOI]

Pierre Bourhis

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

2012

Bounded repairability for regular tree languages.

[BibT_eX]

[DOI]

Slawek Staworko

Proceedings of the 15th International Conference on Database Theory, 2012

2011

On the Use of Guards for Logics with Data.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Regular Repair of Specifications.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Regular Languages of Words over Countable Linear Orderings.

[BibT_eX]

[DOI]

Olivier Carton

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

The Cost of Traveling between Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

Decidability of the Interval Temporal Logic ABB over the Natural Numbers.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Positive higher-order queries.

[BibT_eX]

[DOI]

Huy Vu

Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Automata vs. Logics on Data Words.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 24th International Workshop, 2010

What You Must Remember When Processing Data Words.

[BibT_eX]

[DOI]

Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management, 2010

Automata for Branching and Layered Temporal Structures: An Investigation into Regularities of Infinite Transition Systems

[BibT_eX]

[DOI]

Lecture Notes in Computer Science 5955, Springer, ISBN: 978-3-642-11880-7, 2010

2009

Decidability of the interval temporal logic ABBar over the natural numbers

[BibT_eX]

[DOI]

CoRR, 2009

A theory of ultimately periodic languages and automata with an application to time granularity.

[BibT_eX]

[DOI]

Davide Bresolin

Acta Informatica, 2009

A Decidable Spatial Logic with Cone-Shaped Cardinal Directions.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2007

Compact and tractable automaton-based representations of time granularities.

[BibT_eX]

[DOI]

Ugo Dal Lago

Theor. Comput. Sci., 2007

On the Equivalence of Automaton-Based Representations of Time Granularities.

[BibT_eX]

[DOI]

Ugo Dal Lago

Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (TIME 2007), 2007

A Contraction Method to Decide MSO Theories of Deterministic Trees.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

2006

On the relationships between theories of time granularity and the monadic second-order theory of one successor.

[BibT_eX]

[DOI]

Adriano Peron

J. Appl. Non Class. Logics, 2006

2004

Decidability of the Theory of the Totally Unbounded omega-Layered Structure.

[BibT_eX]

[DOI]

Proceedings of the 11th International Symposium on Temporal Representation and Reasoning (TIME 2004), 2004

Time Granularities and Ultimately Periodic Automata.

[BibT_eX]

[DOI]

Davide Bresolin

Proceedings of the Logics in Artificial Intelligence, 9th European Conference, 2004

Decidability of MSO Theories of Tree Structures.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2003

Towards Compact and Tractable Automaten-Based Representations of Time Granularities.

[BibT_eX]

[DOI]

Ugo Dal Lago