Volgen
Gabriele Puppis
Gabriele Puppis
Dept. of Mathematics, Computer Science, and Physics
Geverifieerd e-mailadres voor uniud.it - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
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
742010
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
452009
Automata vs. logics on data words
M Benedikt, C Ley, G Puppis
International Workshop on Computer Science Logic, 110-124, 2010
392010
What you must remember when processing data words
M Benedikt, C Ley, G Puppis
Proceedings of AMW 2010 619, http://ceur-ws. org/Vol-619/paper11. pdf, 2010
392010
A decidable spatial logic with cone-shaped cardinal directions
A Montanari, G Puppis, P Sala
International Workshop on Computer Science Logic, 394-408, 2009
362009
Towards Compact and Tractable Automaten-Based Representations of Time Granularities.
U Dal Lago, A Montanari, G Puppis
ICTCS 2841, 72-85, 2003
272003
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
24*2016
Regular repair of specifications
M Benedikt, G Puppis, C Riveros
2011 IEEE 26th Annual Symposium on Logic in Computer Science, 335-344, 2011
242011
Time granularities and ultimately periodic automata
D Bresolin, A Montanari, G Puppis
European Workshop on Logics in Artificial Intelligence, 513-525, 2004
242004
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
Regular languages of words over countable linear orderings
O Carton, T Colcombet, G Puppis
International Colloquium on Automata, Languages, and Programming, 125-136, 2011
232011
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
35th IARCS Annual Conference on Foundations of Software Technology and …, 2015
172015
Walking on data words
A Manuel, A Muscholl, G Puppis
Theory of Computing Systems 59 (2), 180-208, 2016
162016
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
The many facets of string transducers (invited talk)
A Muscholl, G Puppis
36th International Symposium on Theoretical Aspects of Computer Science …, 2019
152019
Origin-equivalence of two-way word transducers is in PSPACE
S Bose, A Muscholl, V Penelle, G Puppis
arXiv preprint arXiv:1807.08053, 2018
152018
Logics with rigidly guarded data tests
G Puppis, T Colcombet, C Ley
arXiv preprint arXiv:1410.2022, 2014
15*2014
Automata for branching and layered temporal structures
G Puppis
PhD thesis, Department of Mathematics and Computer Science, University of …, 2006
142006
One-way definability of two-way word transducers
G Puppis, A Muscholl, O Gauwin, F Baschenis
Logical Methods in Computer Science 14, 2018
13*2018
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20