Sfoglia per Autore  

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