Gabriele Puppis
According to our database^{1},
Gabriele Puppis
authored at least 42 papers
between 2003 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at www.labri.fr
On csauthors.net:
Bibliography
2019
The Many Facets of String Transducers (Invited Talk).
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019
2018
Oneway definability of twoway word transducers.
Logical Methods in Computer Science, 2018
An Algebraic Approach to MSODefinability on Countable linear Orderings.
J. Symb. Log., 2018
Resynchronizing Classes of Word Relations.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
OriginEquivalence of TwoWay Word Transducers Is in PSPACE.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018
2017
On the Decomposition of FiniteValued Streaming String Transducers.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017
Untwisting twoway transducers in elementary time.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017
2016
Bounded Repairability for Regular Tree Languages.
ACM Trans. Database Syst., 2016
Querying Visible and Invisible Information.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016
Minimizing Resources of Sweeping and Streaming String Transducers.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
2015
Which XML Schemas are Streaming Bounded Repairable?
Theory Comput. Syst., 2015
Games, Automata, Logics, and Formal Verification (GandALF 2013).
Inf. Comput., 2015
The complexity of higherorder queries.
Inf. Comput., 2015
A decidable weakening of Compass Logic based on coneshaped cardinal directions.
Logical Methods in Computer Science, 2015
Logics with rigidly guarded data tests.
Logical Methods in Computer Science, 2015
Oneway Definability of Sweeping Transducer.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015
2014
The percharacter cost of repairing word languages.
Theor. Comput. Sci., 2014
Decidability of the Interval Temporal Logic $\mathsf{A\bar{A}B\bar{B}}$ over the Rationals.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014
2013
Bounded repairability of word languages.
J. Comput. Syst. Sci., 2013
Which DTDs are streaming bounded repairable?
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013
Walking on Data Words.
Proceedings of the Computer Science  Theory and Applications, 2013
2012
Bounded repairability for regular tree languages.
Proceedings of the 15th International Conference on Database Theory, 2012
2011
On the Use of Guards for Logics with Data.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011
Regular Repair of Specifications.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011
Regular Languages of Words over Countable Linear Orderings.
Proceedings of the Automata, Languages and Programming  38th International Colloquium, 2011
The Cost of Traveling between Languages.
Proceedings of the Automata, Languages and Programming  38th International Colloquium, 2011
2010
Decidability of the Interval Temporal Logic ABB over the Natural Numbers.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010
Positive higherorder queries.
Proceedings of the TwentyNinth ACM SIGMODSIGACTSIGART Symposium on Principles of Database Systems, 2010
Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010
Automata vs. Logics on Data Words.
Proceedings of the Computer Science Logic, 24th International Workshop, 2010
What You Must Remember When Processing Data Words.
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
Lecture Notes in Computer Science 5955, Springer, ISBN: 9783642118807, 2010
2009
A theory of ultimately periodic languages and automata with an application to time granularity.
Acta Inf., 2009
A Decidable Spatial Logic with ConeShaped Cardinal Directions.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009
2007
Compact and tractable automatonbased representations of time granularities.
Theor. Comput. Sci., 2007
On the Equivalence of AutomatonBased Representations of Time Granularities.
Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (TIME 2007), 2007
A Contraction Method to Decide MSO Theories of Deterministic Trees.
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 secondorder theory of one successor.
Journal of Applied NonClassical Logics, 2006
2004
Decidability of the Theory of the Totally Unbounded omegaLayered Structure.
Proceedings of the 11th International Symposium on Temporal Representation and Reasoning (TIME 2004), 2004
Time Granularities and Ultimately Periodic Automata.
Proceedings of the Logics in Artificial Intelligence, 9th European Conference, 2004
Decidability of MSO Theories of Tree Structures.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004
2003
Towards Compact and Tractable AutomatenBased Representations of Time Granularities.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003