Filtrer vos résultats
- 36
- 33
- 42
- 21
- 3
- 2
- 1
- 69
- 2
- 1
- 4
- 4
- 5
- 4
- 5
- 1
- 6
- 2
- 2
- 7
- 2
- 3
- 4
- 8
- 2
- 5
- 1
- 1
- 69
- 53
- 21
- 9
- 9
- 7
- 4
- 4
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 69
- 19
- 11
- 8
- 6
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 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
69 résultats
|
|
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
|
||
|
|
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
|
||
Analysis of Communicating AutomataLanguage and Automata Theory and Applications, 4th International Conference, LATA 2010, 2010, Germany
Communication dans un congrès
hal-00645460v1
|
|||
|
|
Reachability Analysis of Communicating Pushdown SystemsFOSSACS 2010, 2010, Cyprus. pp.267-281, ⟨10.1007/978-3-642-12032-9_19⟩
Communication dans un congrès
hal-00527648v1
|
||
A Kleene Theorem for a Class of Communicating Automata with Effective AlgorithmsDevelopments in Language Theory, 2004, New Zealand. pp.30--48
Communication dans un congrès
hal-00306258v1
|
|||
Two-variable logic on data wordsACM Transactions on Computational Logic, 2011, 12, pp.27
Article dans une revue
hal-00645452v1
|
|||
|
|
Two-Variable Logic on Words with Data21st Annual IEEE Symposium on Logic in Computer Science LICS'06, 2006, Seattle, United States. pp.7-16, ⟨10.1109/LICS.2006.51⟩
Communication dans un congrès
hal-00151749v1
|
||
|
|
Complementing deterministic tree-walking automataInformation Processing Letters, 2006, 99 (1), pp.33 - 39
Article dans une revue
hal-00158657v1
|
||
A lower bound on web services compositionFoundations of Software Science and Computational Structures, 2007, Portugal. pp.274-286
Communication dans un congrès
hal-00306329v1
|
|||
|
|
Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable 26th Conference on Concurrency Theory CONCUR 2015, Sep 2015, Madrid, Spain. pp.72-84, ⟨10.4230/LIPIcs.CONCUR.2015.72⟩
Communication dans un congrès
hal-01394827v1
|
||
|
|
On Canonical Models for Rational Functions over Infinite Words38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Dec 2018, Ahmedabad, India. ⟨10.4230/LIPIcs.FSTTCS.2018.30⟩
Communication dans un congrès
hal-01889429v1
|
||
|
|
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
|
||
|
|
Model-checking linear-time properties of parametrized asynchronous shared-memory pushdown systemsCAV, 2017, Heidelberg, Germany. pp.155-175, ⟨10.1007/978-3-319-63390-9_9⟩
Communication dans un congrès
hal-02397728v1
|
||
|
|
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
|
||
|
|
Recursive queries on trees and data treesProceedings of the 16th International Conference on Database Theory, Mar 2013, Genoa, Italy
Communication dans un congrès
hal-00809297v1
|
||
|
|
Origin-equivalence of two-way word transducers is in PSPACE38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Dec 2018, Ahmedabad, India. ⟨10.4230/LIPIcs.FSTTCS.2018.22⟩
Communication dans un congrès
hal-02415557v1
|
||
A look at the control of asynchronous automataK. Lodaya, M. Mukund, R. Ramanujam. Perspectives in Concurrency Theory, Universities Press India, pp.356--371, 2009
Chapitre d'ouvrage
hal-00355528v1
|
|||
Unlimited Decidability of Distributed Synthesis with Limited Missing KnowledgeMFCS, Mathematical Foundations of Computer Science, 2013, Austria. pp.691-703
Communication dans un congrès
hal-00946679v1
|
|||
|
|
Automated Synthesis of Distributed ControllersICALP 2015, Jul 2015, Kyoto, Japan
Communication dans un congrès
hal-01160530v1
|
||
Characterizations of classes of graphs recognizable by local computationsTheory of Computing Systems, 2004, 37, pp.249--293
Article dans une revue
hal-00307371v1
|
|||
Specifying and Verifying Partial Order Properties Using Template MSCsFoundations of Software Science and Computation Structures, 2004, Spain. pp.195--210
Communication dans un congrès
hal-00306260v1
|
|||
Permutation Rewriting and Algorithmic Verification.2001, pp.160-175
Communication dans un congrès
hal-00161118v1
|
|||
|
|
Active Learning Sound Negotiations37th Annual ACM/IEEE Symposium on Logic in Computer Science ( LICS 2022 ), Aug 2022, Haifa, Israel
Communication dans un congrès
hal-03808843v1
|
||
|
|
One-way definability of two-way word transducersLogical Methods in Computer Science, 2018, 14 (4), ⟨10.23638/LMCS-14(4:22)2018⟩
Article dans une revue
hal-02121085v1
|
||
|
|
Minimization of visibly pushdown automata is NP-completeLogical Methods in Computer Science, 2020, 16 (1)
Article dans une revue
hal-02503147v1
|
||
|
|
Static Analysis of Deterministic Negotiations2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2017, Reykjavik, Iceland. pp.1-12, ⟨10.1109/LICS.2017.8005144⟩
Communication dans un congrès
hal-02397738v1
|
||
Counting in treesTexts in Logic and Games, Amsterdam University Press, pp.575-612, 2007
Chapitre d'ouvrage
hal-00358327v1
|
|||
|
|
Untwisting two-way transducers in elementary time32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'17), Jun 2017, Reykjavik, Iceland. pp.1-12, ⟨10.1109/LICS.2017.8005138⟩
Communication dans un congrès
hal-01864614v1
|
||
Permutation Rewriting and Algorithmic Verification.Information and Computation, 2007, Volume 205, Issue 2 February 2007, p. 199-224
Article dans une revue
hal-00161120v1
|
|||
|
|
Active Context-Free GamesTheory of Computing Systems, 2006, 39 (1), pp.237--276
Article dans une revue
hal-00306333v1
|