Filtrer vos résultats
- 46
- 5
- 35
- 14
- 2
- 50
- 3
- 4
- 2
- 3
- 6
- 3
- 5
- 1
- 6
- 7
- 2
- 4
- 1
- 3
- 1
- 51
- 46
- 15
- 8
- 7
- 5
- 4
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 51
- 12
- 11
- 7
- 6
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
51 résultats
|
|
|
triés par
|
|
|
Time Granularities and Ultimately Periodic Automata9th European Conference on Logics in Artificial Intelligence (JELIA), 2004, Lisbon, Portugal. pp.513-525
Communication dans un congrès
hal-00878413v1
|
||
|
|
Querying Visible and Invisible InformationLICS 2016 - 31st Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2016, New York City, United States. pp.297-306 ⟨10.1145/2933575.2935306⟩
Communication dans un congrès
hal-01411118v1
|
||
|
|
Walking on Data Words8th International Computer Science Symposium in Russia, Jun 2013, Ekaterinburg, Russia. pp.64-75, ⟨10.1007/978-3-642-38536-0_6⟩
Communication dans un congrès
hal-00877065v1
|
||
|
|
On the Use of Guards for Logics with DataProceedings of MFCS 2011, 2011, Warsaw, Poland. pp.243-255, ⟨10.1007/978-3-642-22993-0_24⟩
Communication dans un congrès
istex
hal-00717748v1
|
||
|
|
A Decidable Spatial Logic with Cone-Shaped Cardinal DirectionsProceedings of CSL 2009, 2009, Coimbra, Portugal. pp.394-408, ⟨10.1007/978-3-642-04027-6_29⟩
Communication dans un congrès
hal-00717803v1
|
||
|
|
Decidability of the interval temporal logic AA*BB* over the rationalsProceedings of the 39th International Symposium of Mathematical Foundations of Computer Science (MFCS'14), Aug 2014, Budapest, Hungary. pp.451 - 463
Communication dans un congrès
hal-01076538v1
|
||
|
|
Regular Languages of Words over Countable Linear OrderingsProceedings of ICALP 2011, 2011, Zurich, Switzerland. pp.125-136, ⟨10.1007/978-3-642-22012-8_9⟩
Communication dans un congrès
hal-00717752v1
|
||
|
|
Logics with Rigidly Guarded Data TestsProceedings of FREC 2014 - Frontiers of Recognizability, Apr 2014, Marseille, France. ⟨10.2168/LMCS-11(3:10)2015⟩
Communication dans un congrès
hal-01219499v1
|
||
|
|
An algebraic approach to MSO-definability on countable linear orderingsThe Journal of Symbolic Logic, 2018, 83 (3), pp.1147-1189. ⟨10.1017/jsl.2018.7⟩
Article dans une revue
hal-01470325v2
|
||
|
|
Resynchronizing Classes of Word RelationsInternational Colloquium on Automata, Languages, and Programming (ICALP), Jul 2018, Prague, Czech Republic. ⟨10.4230/LIPIcs.ICALP.2018.123⟩
Communication dans un congrès
hal-01721046v2
|
||
|
|
Bounded repairability of word languagesJournal of Computer and System Sciences, 2013, 79 (8), pp.1302 - 1321. ⟨10.1016/j.jcss.2013.06.001⟩
Article dans une revue
hal-01076529v1
|
||
|
|
Decidability of MSO Theories of Tree Structures24th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2004, Chennai, India. pp.430-442
Communication dans un congrès
hal-00878415v1
|
||
|
|
Automata for Branching and Layered Temporal Structures: an Investigation into Regularities of Infinite Transition SystemsSpringer, pp.1-206, 2010, LNAI, 978-3-642-11880-7. ⟨10.1007/978-3-642-11881-4⟩
Ouvrages
hal-00717778v1
|
||
|
|
On the decomposition of finite-valued streaming string transducers34th International Symposium on Theoretical Aspects of Computer Science (STACS), Mar 2017, Hannover, Germany. ⟨10.4230/LIPIcs⟩
Communication dans un congrès
hal-01431250v1
|
||
|
|
Bounded Repairability for Regular Tree LanguagesACM Transactions on Database Systems, 2016, 41 (3), pp.1-45. ⟨10.1145/2898995⟩
Article dans une revue
hal-01411116v1
|
||
|
|
Proceedings Fourth International Symposium on Games, Automata, Logics and Formal VerificationElectronic Proceedings in Theoretical Computer Science, pp.263, 2013, 2075-2180. ⟨10.4204/EPTCS.119⟩
Ouvrages
hal-00877072v1
|
||
|
|
The many facets of string transducers (invited paper)36th International Symposium on Theoretical Aspects of Computer Science (STACS), Mar 2019, Berlin, Germany. ⟨10.4230/LIPIcs.STACS.2019.2⟩
Communication dans un congrès
hal-02415562v1
|
||
|
|
The complexity of higher-order queriesInformation and Computation, 2015, 244, ⟨10.1016/j.ic.2015.07.003⟩
Article dans une revue
hal-01219505v1
|
||
|
|
Towards Compact and Tractable Automaton-based Representations of Time Granularity8th Italian Conference on Theoretical Computer Science (ICTCS), 2003, Bologna, Italy. pp.72-85
Communication dans un congrès
hal-00878407v1
|
||
|
|
Walking on Data WordsTheory of Computing Systems, 2015, ⟨10.1007/s00224-014-9603-3⟩
Article dans une revue
hal-01219497v1
|
||
Equivalence of automaton-based representations of time granularities2007, Alicante, Spain. 11 p
Communication dans un congrès
hal-00156417v1
|
|||
|
|
Minimizing resources of sweeping and streaming string transducers43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), Jul 2016, Rome, Italy. pp.114:1--114:14, ⟨10.4230/LIPIcs.ICALP.2016.114⟩
Communication dans un congrès
hal-01274992v3
|
||
|
|
On Synthesis of Resynchronizers for Transducers44th International Symposium on Mathematical Foundations of Computer Science (MFCS), Aug 2019, Aachen, Germany. ⟨10.4230/LIPIcs.MFCS.2019.55⟩
Communication dans un congrès
hal-02415574v1
|
||
Regular Languages of Words over Countable Linear OrderingsIcalp 2011, Jul 2011, Zürich, Switzerland. pp.125-136, ⟨10.1007/978-3-642-21254-3_1⟩
Communication dans un congrès
istex
hal-00439263v1
|
|||
|
|
Equivalence of finite-valued streaming string transducers is decidable46th International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2019, Patras, Greece. ⟨10.4230/LIPIcs.ICALP.2019.121⟩
Communication dans un congrès
hal-02415566v1
|
||
|
|
Logics with Rigidly Guarded Data TestsLogical Methods in Computer Science, 2015, 11, ⟨10.2168/LMCS-11(3:10)2015⟩
Article dans une revue
hal-01219503v1
|
||
|
|
One-way definability of sweeping transducers35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), Dec 2015, Bangalore, India
Communication dans un congrès
hal-01219509v2
|
||
|
|
Decidability of the Interval Temporal Logic ABB over the Natural NumbersProceedings of STACS 2010, 2010, Nancy, France. pp.597-608
Communication dans un congrès
hal-00717798v1
|
||
|
|
The per-character cost of repairing word languagesTheoretical Computer Science, 2014, 539, pp.38 - 67. ⟨10.1016/j.tcs.2014.04.021⟩
Article dans une revue
hal-01076532v1
|
||
|
|
Positive higher-order queriesProceedings of PODS 2010, 2010, Indianapolis, United States. pp.27-38, ⟨10.1145/1807085.1807091⟩
Communication dans un congrès
hal-00717792v1
|
- 1
- 2