Filtrer vos résultats
- 27
- 23
- 34
- 7
- 6
- 1
- 1
- 1
- 1
- 50
- 1
- 3
- 5
- 6
- 3
- 3
- 1
- 1
- 2
- 1
- 3
- 1
- 2
- 6
- 1
- 1
- 3
- 5
- 1
- 1
- 1
- 49
- 1
- 25
- 19
- 15
- 6
- 4
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 50
- 7
- 7
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
50 résultats
|
|
|
triés par
|
|
|
Regular Temporal Cost FunctionsInternational Colloquium on Automata, Languages and Programming (ICALP), 2010, Bordeaux, France. pp.563-574
Communication dans un congrès
hal-00859355v1
|
||
|
|
On factorisation forests2007
Pré-publication, Document de travail
hal-00125047v1
|
||
On Equivalent Representations of Infinite Structures30th International Colloquium on Automata, Languages and Programming (ICALP'03), Jun 2003, Netherlands. pp.599-610
Communication dans un congrès
hal-00620143v1
|
|||
|
|
Approximate comparison of distance automata2012
Rapport
hal-00712771v1
|
||
Green's Relations and Their Use in Automata TheoryLanguage and Automata Theory and Applications, May 2011, Tarragone, Spain. pp.1-21, ⟨10.1007/978-3-642-21254-3_1⟩
Communication dans un congrès
istex
hal-00638599v1
|
|||
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
|
|||
|
|
First-order separation over countable ordinalsFoSSaCS 2022, Apr 2022, Munich, Germany. pp.264-284, ⟨10.1007/978-3-030-99253-8_14⟩
Communication dans un congrès
hal-03758110v1
|
||
|
|
A Complexity Approach to Tree Algebras: the Polynomial Case47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Aug 2022, Vienna, Austria. pp.1868-8969, ⟨10.4230/LIPIcs.MFCS.2022.37⟩
Communication dans un congrès
hal-03820478v1
|
||
|
|
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
|
||
|
|
Two-Way Cost Automata and Cost Logics over Infinite TreesJOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC (CSL) AND the Twenty-Ninth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS), 2014, Vienne, Austria. ⟨10.1145/2603088.2603104⟩
Communication dans un congrès
hal-02070744v1
|
||
|
|
Controlling a Random PopulationLogical Methods in Computer Science, 2021, 17 (4), ⟨10.46298/LMCS-17(4:12)2021⟩
Article dans une revue
hal-03410669v1
|
||
|
|
Learning automata and transducers: a categorical approach29th {EACSL} Annual Conference on Computer Science Logic, CSL 2021, Jan 2021, Ljubljana, Slovenia. ⟨10.4230/LIPIcs.CSL.2021.15⟩
Communication dans un congrès
hal-03106961v1
|
||
|
|
A Complexity Approach to Tree Algebras: the Bounded CaseInternational Colloquium on Automata, Languages, and Programming, ICALP, 2021, Glasgow, United Kingdom. ⟨10.4230/LIPIcs.ICALP.2021.127⟩
Communication dans un congrès
hal-03473726v1
|
||
|
|
Z-polyregular functions2023
Pré-publication, Document de travail
hal-04097227v1
|
||
|
|
Safra-like constructions for regular cost functions over finite words2011
Pré-publication, Document de travail
hal-01274408v1
|
||
|
|
Parity games and universal graphs2019
Pré-publication, Document de travail
hal-02395777v1
|
||
|
|
Forms of Determinism for AutomataSTACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.1-23
Communication dans un congrès
hal-00678155v1
|
||
|
|
Optimal transformations of Muller conditions2021
Pré-publication, Document de travail
hal-03110412v1
|
||
|
|
First-order separation over countable ordinals25th International Conference Foundations of Software Science and Computation Structures FOSSACS 2022, Apr 2022, Munich, Germany. pp.264-284, ⟨10.1007/978-3-030-99253-8_14⟩
Communication dans un congrès
hal-04324217v1
|
||
|
|
Transforming structures by set interpretationsLogical Methods in Computer Science, 2007, 3 (2), paper 4. ⟨10.2168/LMCS-3(2:4)2007⟩
Article dans une revue
hal-00192051v1
|
||
Factorisation Forests for Infinite WordsFCT, Aug 2007, Budapest, Hungary. pp.226-237, ⟨10.1007/978-3-540-74240-1_20⟩
Communication dans un congrès
istex
hal-00192027v1
|
|||
On the Use of Guards for Logics with DataMFCS 2011, Apr 2011, Varsovie, Poland. pp.243-255, ⟨10.1007/978-3-642-22993-0_24⟩
Communication dans un congrès
istex
hal-00638611v1
|
|||
|
|
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
|
||
The Bridge Between Regular Cost Functions and Omega-Regular LanguagesInternational Colloquium on Automata, Languages, and Programming, ICALP, 2016, NA, Italy. ⟨10.4230/LIPIcs.ICALP.2016.126⟩
Communication dans un congrès
hal-03410681v1
|
|||
|
|
Représentations et propriétés de structures infiniesLogique en informatique [cs.LO]. Université de Rennes 1, 2004. Français. ⟨NNT : 2004REN10094⟩
Thèse
tel-04504198v1
|
||
|
|
The Theory of Stabilisation Monoids and Regular Cost FunctionsICALP, Jul 2009, Rhodes, Greece. pp.139-150, ⟨10.1007/978-3-642-02930-1_12⟩
Communication dans un congrès
hal-00439259v1
|
||
|
|
The Non-deterministic Mostowski Hierarchy and Distance-Parity AutomataICALP'08, Jul 2008, Reykjavik, Iceland. pp.398-409, ⟨10.1007/978-3-540-70583-3⟩
Communication dans un congrès
hal-00347194v1
|
||
Playing SafeFoundations of Software Technology and Theoretical Computer Science, FSTTCS, 2014, NA, India. ⟨10.4230/LIPIcs.FSTTCS.2014.379⟩
Communication dans un congrès
hal-03410685v1
|
|||
|
|
Universal Graphs and Good for Games Automata: New Tools for Infinite Duration GamesFoundations of Software Science and Computation Structures - 22nd International Conference, FOSSACS 2019, Apr 2019, Prague, Czech Republic. ⟨10.1007/978-3-030-17127-8⟩
Communication dans un congrès
hal-02415887v1
|
||
On Reachability Problems for Low-Dimensional Matrix Semigroups46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Jul 2019, Patras, Greece. ⟨10.4230/LIPIcs.ICALP.2019.44⟩
Communication dans un congrès
hal-02415432v1
|
- 1
- 2