Sfoglia per Autore
Towards Compact and Tractable Automaton-Based Representations of Time Granularities
2003-01-01 Lago, U. D.; Montanari, A.; Puppis, G.
Decidability of the Theory of the Totally Unbounded omega-Layered Structure
2004-01-01 Montanari, Angelo; Puppis, G.
Decidability of MSO Theories of Tree Structures
2004-01-01 Montanari, Angelo; Puppis, Gabriele
Time Granularities and Ultimately Periodic Automata
2004-01-01 Bresolin, Davide; Montanari, Angelo; Puppis, Gabriele
On the relationships between theories of time granularity and the monadic second-order theory of one successor
2006-01-01 Montanari, Angelo; Peron, A; Puppis, Gabriele
Compact and Tractable Automaton-based Representations for Time Granularities
2007-01-01 DAL LAGO, U; Montanari, Angelo; Puppis, Gabriele
A Contraction Method to Decide MSO Theory of Deterministic Trees
2007-01-01 Montanari, Angelo; Puppis, Gabriele
On the Equivalence of Automaton-based Representations of Time Granularities
2007-01-01 DAL LAGO, Ugo; Montanari, Angelo; Puppis, Gabriele
A Theory of Ultimately Periodic Languages and Automata with an Application to Time Granularity
2009-01-01 Bresolin, D; Montanari, Angelo; Puppis, G.
A Decidable Spatial Logic with Cone-shaped Cardinal Directions
2009-01-01 Montanari, Angelo; Puppis, G.; Sala, Pietro
Decidability of the interval temporal logic ABB* over the natural numbers
2010-01-01 Montanari, Angelo; Puppis, Gabriele; Sala, Pietro; Sciavicco, G.
What you must remember when processing data words
2010-01-01 Benedikt, M.; Ley, C.; Puppis, G.
Maximal decidable fragments of Halpern and Shoham's modal logic of intervals
2010-01-01 Montanari, Angelo; Puppis, G; Sala, Pietro
Positive higher-order queries
2010-01-01 Benedikt, M.; Puppis, G.; Vu, H.
Automata for branching and layered temporal structures: An investigation into regularities of infinite transition systems
2010-01-01 Puppis, G.
Automata vs. logics on data words
2010-01-01 Benedikt, M.; Ley, C.; Puppis, G.
The cost of traveling between languages
2011-01-01 Benedikt, M.; Puppis, G.; Riveros, C.
Regular repair of specifications
2011-01-01 Benedikt, M.; Puppis, G.; Riveros, C.
On the use of guards for logics with data
2011-01-01 Colcombet, T.; Ley, C.; Puppis, G.
Regular languages of words over countable linear orderings
2011-01-01 Carton, O.; Colcombet, T.; Puppis, G.
Bounded repairability for regular tree languages
2012-01-01 Puppis, G.; Riveros, C.; Staworko, S.
Walking on data words
2013-01-01 Manuel, A.; Muscholl, A.; Puppis, G.
Which DTDs are streaming bounded repairable?
2013-01-01 Bourhis, P.; Puppis, G.; Riveros, C.
Bounded repairability of word languages
2013-01-01 Benedikt, M.; Puppis, G.; Riveros, C.
Proceedings of GANDALF 2013, Fourth International Symposium on Games, Automata, Logics and Formal Verification
2013-01-01 Puppis, G.; Villa, T.
The per-character cost of repairing word languages
2014-01-01 Benedikt, M.; Puppis, G.; Riveros, C.
Decidability of the interval temporal logic AA*BB* over the rationals
2014-01-01 Montanari, Angelo; Puppis, G; Sala, P.
One-way definability of sweeping transducers
2015-01-01 Baschenis, F.; Gauwin, O.; Muscholl, A.; Puppis, G.
Which XML Schemas are Streaming Bounded Repairable?
2015-01-01 Bourhis, P.; Puppis, G.; Riveros, C.
The complexity of higher-order queries
2015-01-01 Benedikt, M.; Puppis, G.; Vu, H.
Games, Automata, Logic, and Formal Verification (GandALF 2013) - Special Issue of the journal Information and Computation, Editorial pp. 1-2
2015-01-01 Montanari, Angelo; Puppis, Gabriele; Villa, Tiziano
Logics with rigidly guarded data tests
2015-01-01 Colcombet, T.; Ley, C.; Puppis, G.
A decidable weakening of compass logic based on cone-shaped cardinal directions
2015-01-01 Montanari, A.; Puppis, G.; Sala, P.
Minimizing resources of sweeping and streaming string transducers
2016-01-01 Baschenis, F.; Gauwin, O.; Muscholl, A.; Puppis, G.
Walking on Data Words
2016-01-01 Manuel, A.; Muscholl, A.; Puppis, G.
Querying Visible and Invisible Information
2016-01-01 Benedikt, M.; Bourhis, P.; Ten Cate, B.; Puppis, G.
Bounded repairability for regular tree languages
2016-01-01 Bourhis, P.; Puppis, G.; Riveros, C.; Staworko, S.
On the decomposition of finite-valued streaming string transducers
2017-01-01 Gallot, P.; Muscholl, A.; Puppis, G.; Salvati, S.
Untwisting two-way transducers in elementary time
2017-01-01 Baschenis, F.; Gauwin, O.; Muscholl, A.; Puppis, G.
Origin-equivalence of two-way word transducers is in PSPACE
2018-01-01 Bose, Sougata; Muscholl, Anca; Puppis, Gabriele; Penelle, Vincent
One-way definability of two-way word transducers
2018-01-01 Baschenis, F.; Gauwin, O.; Muscholl, A.; Puppis, G.
Resynchronizing classes of word relations
2018-01-01 Descotte, M. E.; Figueira, D.; Puppis, G.
An Algebraic Approach to Mso-Definability on Countable Linear Orderings
2018-01-01 Carton, O.; Colcombet, T.; Puppis, G.
On synthesis of resynchronizers for transducers
2019-01-01 Bose, S.; Krishna, S. N.; Muscholl, A.; Penelle, V.; Puppis, G.
The many facets of string transducers
2019-01-01 Muscholl, A.; Puppis, G.
Equivalence of finite-valued streaming string transducers is decidable
2019-01-01 Muscholl, A.; Puppis, G.
Inference from Visible Information and Background Knowledge
2021-01-01 Benedikt, Michael; Bourhis, Pierre; ten Cate, Balder; Puppis, Gabriele; Vanden Boom, Michael
One-way resynchronizability of word transducers
2021-01-01 Bose, S.; Krishna, S. N.; Muscholl, A.; Puppis, G.
Dynamic data structures for timed automata acceptance
2021-01-01 Grez, A.; Mazowiecki, F.; Pilipczuk, M.; Puppis, G.; Riveros, C.
Ciaramella: A Synchronous Data Flow Programming Language For Audio DSP
2022-01-01 Marrone, Paolo; D’Angelo, Stefano; Fontana, Federico; Costagliola, Gennaro; Puppis, Gabriele
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile