| 1 |
Parametric updates in parametric timed automata
|
|
|
|
In: EISSN: 1860-5974 ; Logical Methods in Computer Science ; https://hal.archives-ouvertes.fr/hal-03340905 ; Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2021, 17 (2), pp.13:1-13:67. ⟨10.23638/LMCS-17(2:13)2021⟩ ; https://lmcs.episciences.org/7470 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 4 |
Single-Use Automata and Transducers for Infinite Alphabets ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 5 |
Resynchronizing Classes of Word Relations
|
|
|
|
In: International Colloquium on Automata, Languages, and Programming (ICALP) ; https://hal.archives-ouvertes.fr/hal-01721046 ; International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2018, Prague, Czech Republic. ⟨10.4230/LIPIcs.ICALP.2018.123⟩ ; https://iuuk.mff.cuni.cz/~icalp2018/ (2018)
|
|
BASE
|
|
Show details
|
|
|
| 6 |
One-way definability of two-way word transducers
|
|
|
|
In: EISSN: 1860-5974 ; Logical Methods in Computer Science ; https://hal.archives-ouvertes.fr/hal-02121085 ; Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2018, 14 (4), ⟨10.23638/LMCS-14(4:22)2018⟩ ; https://lmcs.episciences.org/5021 (2018)
|
|
BASE
|
|
Show details
|
|
|
| 7 |
What Does This Notation Mean Anyway? ; What Does This Notation Mean Anyway?: MBNF-Style Notation as it is Actually Used
|
|
|
|
In: 13th international Workshop on Logical Frameworks and Meta-Languages: Theory and Practice ; https://hal.inria.fr/hal-01812800 ; 13th international Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, Jul 2018, Oxford, United Kingdom (2018)
|
|
BASE
|
|
Show details
|
|
|
| 8 |
Invariance: a Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms
|
|
|
|
In: Springer, LNCS. ; https://hal-normandie-univ.archives-ouvertes.fr/hal-02117030 ; Springer, LNCS., 2017, pp.214-227 (2017)
|
|
BASE
|
|
Show details
|
|
|
| 9 |
Varieties of Cost Functions
|
|
|
|
In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 ; https://hal.archives-ouvertes.fr/hal-01614389 ; 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, Feb 2016, Orléans, France. pp.1-30, ⟨10.4230/LIPIcs.STACS.2016.30⟩ ; http://www.dagstuhl.de/dagpub/978-3-95977-001-9 (2016)
|
|
BASE
|
|
Show details
|
|
|
| 10 |
First-order definability of rational transductions: An algebraic approach
|
|
|
|
In: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'16) ; 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'16) ; https://hal.archives-ouvertes.fr/hal-01308509 ; 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'16), Jul 2016, New York, United States. pp.387--396, ⟨10.1145/2933575.2934520⟩ ; http://lics.rwth-aachen.de/lics16/ (2016)
|
|
BASE
|
|
Show details
|
|
|
| 11 |
Adding modular predicates to first-order fragments
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-00934622 ; 2015 (2015)
|
|
BASE
|
|
Show details
|
|
|
| 12 |
Non-linear Second order Abstract Categorial Grammars and deletion
|
|
|
|
In: NLCS 2015: Natural Language and Computer Science ; https://hal.archives-ouvertes.fr/hal-01251127 ; NLCS 2015: Natural Language and Computer Science, Makoto Kanazawa, 2015, Kyoto, Japan (2015)
|
|
BASE
|
|
Show details
|
|
|
| 13 |
Ambiguity of $\omega$-Languages of Turing Machines
|
|
|
|
In: EISSN: 1860-5974 ; Logical Methods in Computer Science ; https://hal.archives-ouvertes.fr/hal-00735050 ; Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2014, 10 (3:12), pp.1-18 (2014)
|
|
BASE
|
|
Show details
|
|
|
| 14 |
Forcing MSO on Infinite Words in Weak MSO
|
|
|
|
In: 28th Annual ACM/IEEE Symposium on Logic in Computer Science ; https://hal.archives-ouvertes.fr/hal-00776921 ; 28th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2013, New Orleans, United States. pp.448-457, ⟨10.1109/LICS.2013.51⟩ (2013)
|
|
BASE
|
|
Show details
|
|
|
| 15 |
Natural Language Generation for Language Learning ; Génération automatique de phrases pour l’apprentissage des langues
|
|
|
|
In: https://hal.inria.fr/tel-01749799 ; Artificial Intelligence [cs.AI]. Université de Lorraine, 2013. English. ⟨NNT : 2013LORR0062⟩ (2013)
|
|
BASE
|
|
Show details
|
|
|
| 16 |
On the Complexity of Free Word Orders
|
|
|
|
In: Formal Grammar ; https://hal.inria.fr/hal-00945516 ; Formal Grammar, 2013, Tuebingen, Germany (2013)
|
|
BASE
|
|
Show details
|
|
|
| 17 |
The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars
|
|
|
|
In: Formal Grammar ; https://hal.inria.fr/hal-00945526 ; Formal Grammar, 2013, Tuebingen, Germany (2013)
|
|
BASE
|
|
Show details
|
|
|
| 18 |
Minimalist Grammars in the Light of Logic
|
|
|
|
In: https://hal.inria.fr/inria-00563807 ; [Research Report] 2011, pp.39 (2011)
|
|
BASE
|
|
Show details
|
|
|
| 20 |
The Copying Power of Well-Nested Multiple Context-Free Grammars
|
|
|
|
In: Language and Automata Theory and Applications ; https://hal.inria.fr/inria-00525077 ; Language and Automata Theory and Applications, 2010, Trier, Germany. pp.344-355, ⟨10.1007/978-3-642-13089-2_29⟩ ; http://www.springerlink.com/content/b8w7r53761614lk7/ (2010)
|
|
BASE
|
|
Show details
|
|
|
|
|
