Benjamin Monmege
9
Documents
Publications
- 9
- 5
- 5
- 3
- 3
- 1
- 3
- 2
- 2
- 1
- 1
|
A Robust Class of Data Languages and an Application to LearningLogical Methods in Computer Science, 2014, 10 (4:19), ⟨10.2168/LMCS-10(4:19)2014⟩
Article dans une revue
hal-00920945v2
|
|
Pebble Weighted Automata and Weighted LogicsACM Transactions on Computational Logic, 2014, 15 (2), pp.15. ⟨10.1145/2579819⟩
Article dans une revue
hal-00964994v2
|
|
Logical Characterization of Weighted Pebble Walking AutomataCSL-LICS '14, Jul 2014, Vienna, Austria. ⟨10.1145/2603088.2603118⟩
Communication dans un congrès
hal-01006125v1
|
|
Weighted Specifications over Nested WordsFoundations of Software Science and Computation Structures (FoSSaCS'13), Mar 2013, Rome, Italy. pp.385-400, ⟨10.1007/978-3-642-37075-5_25⟩
Communication dans un congrès
hal-00909035v1
|
|
A Fresh Approach to Learning Register AutomataDevelopments in Language Theory, 2013, France. pp.118-130, ⟨10.1007/978-3-642-38771-5_12⟩
Communication dans un congrès
hal-00908998v1
|
|
A Probabilistic Kleene TheoremAutomated Technology for Verification and Analysis (ATVA'12), Oct 2012, Thiruvananthapuram, India. pp.400-415, ⟨10.1007/978-3-642-33386-6_31⟩
Communication dans un congrès
hal-00909042v1
|
|
Pebble weighted automata and transitive closure logicsProceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10) - Part II, Jul 2010, Bordeaux, France. pp.587-598, ⟨10.1007/978-3-642-14162-1_49⟩
Communication dans un congrès
hal-00608179v1
|
|
A Fresh Approach to Learning Register Automata2012
Rapport
hal-00743240v3
|
Weighted Expressions and DFS Tree Automata[Research Report] LSV-11-08, 2011
Rapport
hal-00779951v1
|