Filtrer vos résultats
- 31
- 16
- 27
- 15
- 2
- 2
- 1
- 47
- 1
- 1
- 3
- 2
- 1
- 1
- 4
- 3
- 2
- 3
- 3
- 5
- 1
- 4
- 2
- 1
- 5
- 3
- 2
- 46
- 1
- 39
- 11
- 9
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 47
- 17
- 6
- 4
- 4
- 3
- 3
- 3
- 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
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
47 résultats
|
|
|
triés par
|
|
|
Weakly-unambiguous Parikh automata and their link to holonomic seriesICALP 2020 - 47th International Colloquium on Automata, Languages and Programming, Jul 2020, Saarbrücken, Germany. pp.114.1-114.16, ⟨10.4230/LIPIcs.ICALP.2020.114⟩
Communication dans un congrès
hal-03084639v1
|
||
|
|
C-SHORe: a collapsible approach to higher-order verificationACM SIGPLAN International Conference on Functional Programming (ICFP'13), Sep 2013, Boston, MA, United States. pp.13-24, ⟨10.1145/2500365.2500589⟩
Communication dans un congrès
hal-00865155v1
|
||
|
|
A Saturation Method for Collapsible Pushdown SystemsAutomata, Languages and Programming, 39th International Colloquium, ICALP 2012, 2012, Warwick, United Kingdom. pp.165-176, ⟨10.1007/978-3-642-31585-5_18⟩
Communication dans un congrès
hal-00694991v1
|
||
|
|
Higher-Order Recursion Schemes and Collapsible Pushdown Automata: Logical PropertiesACM Transactions on Computational Logic, 2021, 22 (2), ⟨10.1145/3452917⟩
Article dans une revue
hal-03014425v1
|
||
|
|
Qualitative Tree LanguagesTwenty-Sixth Annual IEEE Symposium on Logic in Computer Science (LICS 2011), 2011, Toronto, Canada. pp.13-22, ⟨10.1109/LICS.2011.28⟩
Communication dans un congrès
hal-00616304v1
|
||
Preface : Fixed Points in Computer Science (FICS) 2013Fundamenta Informaticae, 2017, 150 (3-4), pp.i-ii. ⟨10.3233/FI-2017-1468⟩
Article dans une revue
hal-03116273v1
|
|||
The Caucal Hierarchy of Infinite Graphs in Terms of Logic23rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'03), Dec 2003, United States. pp.112-123
Communication dans un congrès
hal-00620170v1
|
|||
|
|
On Rational Trees20th International Conference on Computer Science Logic (CSL'06), Sep 2006, Szeged, Hungary. pp.225-239
Communication dans un congrès
hal-00620171v1
|
||
|
|
Distribution of the number of accessible states in a random deterministic automatonSTACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.194-205
Communication dans un congrès
hal-00678213v1
|
||
|
|
Choice functions and well-orderings over the infinite binary treeCentral European Journal of Mathematics, 2010, 8 (6), pp.662-682. ⟨10.2478/s11533-010-0046-z⟩
Article dans une revue
hal-00733452v1
|
||
|
|
Counting Branches in Trees Using GamesInformation and Computation, 2017, 252, pp.221-242. ⟨10.1016/j.ic.2016.11.005⟩
Article dans une revue
hal-01563189v1
|
||
On the representation of McCarthy's amb in the Pi-calculusTheoretical Computer Science, 2005, 330 (3), pp.439-473
Article dans une revue
hal-00619703v1
|
|||
Regular Sets of Higher-Order Pushdown Stacks30th International Symposium on Mathematical Foundations of Computer Science (MFCS'05), Aug 2005, Poland. pp.168-179
Communication dans un congrès
hal-00620141v1
|
|||
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
|
|||
|
|
How Good Is a Strategy in a Game with Nature?ACM Transactions on Computational Logic, 2020, 21 (3), pp.21:1-21:39. ⟨10.1145/3377137⟩
Article dans une revue
hal-02487233v1
|
||
|
|
Linearly bounded infinite graphsActa Informatica, 2006, 43 (4), p. 265-292. ⟨10.1007/s00236-006-0022-z⟩
Article dans une revue
hal-00149109v1
|
||
Uniformization in Automata TheoryLogic, Methodology and Philosophy of Science - Proceedings of the 14th International Congress, 2015
Chapitre d'ouvrage
hal-01806575v1
|
|||
|
|
Automata on Infinite Trees with Equality and Disequality Constraints Between SiblingsLICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2016, New York, United States. pp.227-236, ⟨10.1145/2933575.2934504⟩
Communication dans un congrès
hal-01804545v1
|
||
|
|
Algebraic synchronization trees and processesInternational Colloquium on Automata, Languages, and Programming (ICALP 2012), 2012, United Kingdom. pp.30-41, ⟨10.1007/978-3-642-31585-5_7⟩
Communication dans un congrès
hal-00733449v1
|
||
|
|
Winning regions of higher-order pushdown gamesTwenty-Third Annual IEEE Symposium on Logic in Computer Science (LICS 2008), Jun 2008, Pittsburgh, United States. pp.193-204
Communication dans un congrès
hal-00345939v1
|
||
|
|
FICS 20107th Workshop on Fixed Points in Computer Science, FICS 2010, Aug 2010, Brno, Czech Republic. pp.89
Communication dans un congrès
hal-00512377v1
|
||
|
|
Pure Strategies in Imperfect Information Stochastic GamesFundamenta Informaticae, 2018, 160 (4), pp.361-384. ⟨10.3233/FI-2018-1687⟩
Article dans une revue
hal-01831546v1
|
||
|
|
Regular Strategies In Pushdown Reachability GamesRP 2014, 2014, Oxford, United Kingdom. pp.58-71, ⟨10.1007/978-3-319-11439-2_5⟩
Communication dans un congrès
hal-01719810v1
|
||
|
|
Randomisation in Automata on Infinite TreesACM Transactions on Computational Logic, 2014, 15 (3), pp.24. ⟨10.1145/2629336⟩
Article dans une revue
hal-01260669v1
|
||
|
|
Higher-order recursion schemes and their automata modelsJean-Éric Pin. Handbook of Automata Theory, 2, European Mathematical Society, pp.1295-1341, 2021, 978-3-98547-006-8
Chapitre d'ouvrage
hal-03176662v1
|
||
Linear Orders in the Pushdown HierarchyInternational Colloquium on Automata, Languages, and Programming (ICALP 2010), 2010, Bordeaux, France. pp.88--99
Communication dans un congrès
hal-00733438v1
|
|||
Positional Strategies for Higher-Order Pushdown Parity Games33rd International Symposium on Mathematical Foundations of Computer Science (MFCS'08), 2008, United States. pp.217-228
Communication dans un congrès
hal-00620254v1
|
|||
|
|
Collapsible pushdown automata and labeled recursion schemes. equivalence, safety and effective selectionLICS 2012, Jun 2012, Dubrovnik, Croatia. pp.165-174, ⟨10.1109/LICS.2012.73⟩
Communication dans un congrès
hal-00733467v1
|
||
|
|
The Kleene Equality for Graphs31st International Symposium on Mathematical Foundations of Computer Science (MFCS'06), Aug 2006, Stará Lesná, Slovakia. pp.214-225, ⟨10.1007/11821069_19⟩
Communication dans un congrès
hal-00620173v1
|
||
|
|
An Analysis of the Equational Properties of the Well-Founded Fixed PointKR 2016, Apr 2016, Capetown, South Africa. pp.533-536, ⟨10.1016/j.jlamp.2016.09.004⟩
Communication dans un congrès
hal-01806560v1
|
- 1
- 2