Stebėti
Gabriele Puppis
Gabriele Puppis
Dept. of Mathematics, Computer Science, and Physics
Patvirtintas el. paštas uniud.it - Pagrindinis puslapis
Pavadinimas
Cituota
Cituota
Metai
Maximal decidable fragments of Halpern and Shoham’s modal logic of intervals
A Montanari, G Puppis, P Sala
International Colloquium on Automata, Languages, and Programming, 345-356, 2010
762010
Decidability of the interval temporal logic ABBar over the natural numbers
A Montanari, G Puppis, P Sala, G Sciavicco
arXiv preprint arXiv:0912.3429, 2009
472009
Automata vs. logics on data words
M Benedikt, C Ley, G Puppis
Computer Science Logic: 24th International Workshop, CSL 2010, 19th Annual …, 2010
392010
A decidable spatial logic with cone-shaped cardinal directions
A Montanari, G Puppis, P Sala
Computer Science Logic: 23rd international Workshop, CSL 2009, 18th Annual …, 2009
392009
What you must remember when processing data words
M Benedikt, C Ley, G Puppis
AMW'10: Proceedings of the 4th Alberto Mendelzon International Workshop on …, 2010
382010
The many facets of string transducers (invited talk)
A Muscholl, G Puppis
36th International Symposium on Theoretical Aspects of Computer Science …, 2019
302019
Regular repair of specifications
M Benedikt, G Puppis, C Riveros
2011 IEEE 26th Annual Symposium on Logic in Computer Science, 335-344, 2011
292011
Towards compact and tractable automaton-based representations of time granularities
U Dal Lago, A Montanari, G Puppis
Theoretical Computer Science: 8th Italian Conference, ICTCS 2003, Bertinoro …, 2003
282003
Regular languages of words over countable linear orderings
O Carton, T Colcombet, G Puppis
International Colloquium on Automata, Languages, and Programming, 125-136, 2011
272011
Time granularities and ultimately periodic automata
D Bresolin, A Montanari, G Puppis
Logics in Artificial Intelligence: 9th European Conference, JELIA 2004 …, 2004
262004
Querying visible and invisible information
M Benedikt, P Bourhis, B Ten Cate, G Puppis
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016
25*2016
Minimizing resources of sweeping and streaming string transducers
F Baschenis, O Gauwin, A Muscholl, G Puppis
43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016
232016
Logics with rigidly guarded data tests
T Colcombet, C Ley, G Puppis
Log. Methods Comput. Sci 11 (3), 1-56, 2015
20*2015
Untwisting two-way transducers in elementary time
F Baschenis, O Gauwin, A Muscholl, G Puppis
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017
172017
One-way definability of sweeping transducers
F Baschenis, O Gauwin, A Muscholl, G Puppis
Proceedings of the 35th IARCS Conference on Foundations of Software …, 2015
172015
Origin-equivalence of two-way word transducers is in PSPACE
S Bose, A Muscholl, V Penelle, G Puppis
arXiv preprint arXiv:1807.08053, 2018
162018
On the use of guards for logics with data
T Colcombet, C Ley, G Puppis
International Symposium on Mathematical Foundations of Computer Science, 243-255, 2011
162011
Compact and tractable automaton-based representations of time granularities
U Dal Lago, A Montanari, G Puppis
Theoretical Computer Science 373 (1-2), 115-141, 2007
162007
One-way definability of two-way word transducers
F Baschenis, O Gauwin, A Muscholl, G Puppis
Logical Methods in Computer Science 14, 2018
152018
Walking on data words
A Manuel, A Muscholl, G Puppis
Theory of Computing Systems 59 (2), 180-208, 2016
152016
Sistema negali atlikti operacijos. Bandykite vėliau dar kartą.
Straipsniai 1–20