Filtrer vos résultats
- 22
- 6
- 17
- 8
- 1
- 1
- 1
- 27
- 1
- 2
- 2
- 2
- 1
- 3
- 2
- 4
- 3
- 1
- 3
- 2
- 1
- 1
- 1
- 28
- 16
- 10
- 10
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 28
- 8
- 6
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
28 résultats
|
|
triés par
|
|
Conciliation and Consensus in Iterated Belief Mergingpp.19, 2004
Ouvrages
hal-00018364v1
|
||
|
Visibly Pushdown Automata: Universality and Inclusion via Antichains7th International Conference on Language and Automata Theory and Applications, 2013, Bilbao, Spain. pp.190-201, ⟨10.1007/978-3-642-37064-9_18⟩
Communication dans un congrès
hal-00821218v1
|
||
|
Streaming Tree Automata and XPathSoftware Engineering [cs.SE]. Université des Sciences et Technologie de Lille - Lille I, 2009. English. ⟨NNT : ⟩
Thèse
tel-00421911v3
|
||
|
First-order definability of rational transductions: An algebraic approach31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'16), Jul 2016, New York, United States. pp.387--396, ⟨10.1145/2933575.2934520⟩
Communication dans un congrès
hal-01308509v1
|
||
|
Queries on XML Streams with Bounded Delay and ConcurrencyInformation and Computation, 2011, Special Issue: 3rd International Conference on Language and Automata Theory and Applications (LATA 2009), 209 (3), pp.409-442. ⟨10.1016/j.ic.2010.08.003⟩
Article dans une revue
inria-00491495v1
|
||
|
Streamability of nested word transductionsLogical Methods in Computer Science, 2019
Article dans une revue
hal-02103898v1
|
||
|
Right-Universality of Visibly Pushdown Automata4th International Conference on Runtime Verification, Sep 2013, Rennes, France. pp.76-93, ⟨10.1007/978-3-642-40787-1_5⟩
Communication dans un congrès
hal-00946193v1
|
||
|
Streaming Tree AutomataInformation Processing Letters, 2008, 109 (1), pp.13-17. ⟨10.1016/j.ipl.2008.08.002⟩
Article dans une revue
inria-00288445v3
|
||
|
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
|
||
|
Streamability of Nested Word TransductionsFSTTCS - 31st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science - 2011, Dec 2011, Mumbai, India. pp.312-324, ⟨10.4230/LIPIcs.FSTTCS.2011.312⟩
Communication dans un congrès
inria-00566409v2
|
||
|
Earliest Query Answering for Deterministic Nested Word Automata17th International Symposium on Fundamentals of Computer Theory, Sep 2009, Wraclaw, Poland. pp.121-132
Communication dans un congrès
inria-00390236v2
|
||
|
Complexity of Earliest Query Answering with Streaming Tree AutomataACM SIGPLAN Workshop on Programming Language Techniques for XML (PLAN-X), Jan 2008, San Francisco, United States
Communication dans un congrès
inria-00336169v1
|
||
|
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
|
||
|
Transductions: resources and characterizationsFormal Languages and Automata Theory [cs.FL]. Université de Bordeaux, 2020
HDR
tel-03118919v1
|
||
|
From Two-Way to One-Way Finite State Transducers28th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2013, New Orleans, United States. pp.468-477, ⟨10.1109/LICS.2013.53⟩
Communication dans un congrès
hal-00946161v1
|
||
|
Logical and Algebraic Characterizations of Rational TransductionsLogical Methods in Computer Science, 2019, 15 (4), ⟨10.23638/LMCS-15(4:16)2019⟩
Article dans une revue
hal-02503054v1
|
||
|
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
|
||
|
Aperiodicity of rational functions is PSpace-complete36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016), Dec 2016, Chennai, India
Communication dans un congrès
hal-01410188v1
|
||
|
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
|
||
Conciliation through Iterated Belief MergingJournal of Logic and Computation, 2007, 17, pp.909-937
Article dans une revue
hal-00191108v1
|
|||
|
Early Nested Word Automata for XPath Query Answering on XML Streams18th International Conference on Implementation and Application of Automata, Jul 2013, Halifax, Canada. pp.292-305
Communication dans un congrès
hal-00676178v2
|
||
|
Streamable Fragments of Forward XPath16th International Conference on Implementation and Application of Automata, Jul 2011, Blois, France. pp.3-15
Communication dans un congrès
inria-00442250v1
|
||
|
Bounded Delay and Concurrency for Earliest Query Answering3rd International Conference on Language and Automata Theory and Applications, Apr 2009, Tarragona, Spain. pp.350-361, ⟨10.1007/978-3-642-00982-2⟩
Communication dans un congrès
inria-00348463v1
|
||
|
Efficient Enumeration for Conjunctive Queries over X-underbar Structures19th EACSL Annual Conference on Computer Science Logic, Aug 2010, Brno, Czech Republic. pp.80-94, ⟨10.1007/978-3-642-15205-4_10⟩
Communication dans un congrès
hal-00489955v1
|
||
|
Early Nested Word Automata for XPath Query Answering on XML StreamsTheoretical Computer Science, 2015, 578, pp.100-125. ⟨10.1016/j.tcs.2015.01.017⟩
Article dans une revue
hal-00966625v1
|
||
Iterated Belief Merging as Conciliation Operators7th International Symposium on Logical Formalizations of Commonsense Reasoning(CommonSense'05), 2005, Corfou, Greece
Communication dans un congrès
hal-00456087v1
|