| 1 |
A gentle introduction to Girard's Transcendental Syntax for the linear logician
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2022 (2022)
|
|
BASE
|
|
Show details
|
|
|
| 2 |
Formal Language Recognition by Hard Attention Transformers: Perspectives from Circuit Complexity ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 4 |
Multiplicative Linear Logic from Logic Programs and Tilings
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02895111 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 5 |
A gentle introduction to Girard's Transcendental Syntax for the linear logician
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 6 |
Stellar Resolution: Multiplicatives - for the linear logician, through examples
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 7 |
A gentle introduction to Girard's Transcendental Syntax for the linear logician
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 8 |
Stellar Resolution: Multiplicatives - for the linear logician, through examples
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 9 |
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
|
|
|
| 10 |
Symbolic Model-based Design and Generation of Logical Scenarios for Autonomous Vehicles Validation
|
|
|
|
In: 2021 IEEE Intelligent Vehicles Symposium (IV) ; https://hal.archives-ouvertes.fr/hal-03540190 ; 2021 IEEE Intelligent Vehicles Symposium (IV), Jul 2021, Nagoya, Japan. pp.215-222, ⟨10.1109/IV48863.2021.9575528⟩ (2021)
|
|
BASE
|
|
Show details
|
|
|
| 11 |
"By the way, do you like Spider Man?" -Towards A Social Planning Model for Rapport
|
|
|
|
In: SemDial 2021 - 25th Workshop on the Semantics and Pragmatics of Dialogue ; https://hal.inria.fr/hal-03536332 ; SemDial 2021 - 25th Workshop on the Semantics and Pragmatics of Dialogue, Sep 2021, Potsdam / Virtual, Germany (2021)
|
|
BASE
|
|
Show details
|
|
|
| 12 |
Improving Automation for Higher-Order Proof Steps
|
|
|
|
In: Lecture Notes ; FroCos 2021 - 13th International Symposium on Frontiers of Combining Systems ; https://hal.archives-ouvertes.fr/hal-03528009 ; FroCos 2021 - 13th International Symposium on Frontiers of Combining Systems, Sep 2021, Birmingham, United Kingdom. pp.139-153, ⟨10.1007/978-3-030-86205-3_8⟩ (2021)
|
|
BASE
|
|
Show details
|
|
|
| 13 |
Identification et gestion des données personnelles dans les textes ; Identification et gestion des données personnelles dans les textes: modèle sémantique et applications
|
|
|
|
In: CiDE.22 : 22éme édition du Colloque International sur le Document Electronique Données Documents Connaissances : Perspectives de recherche et d’enseignement ; https://hal.archives-ouvertes.fr/hal-03506075 ; CiDE.22 : 22éme édition du Colloque International sur le Document Electronique Données Documents Connaissances : Perspectives de recherche et d’enseignement, Dec 2021, Paris, France (2021)
|
|
BASE
|
|
Show details
|
|
|
| 14 |
Data Papers et dissémination des données de la recherche : quelles pratiques en SHS ?
|
|
|
|
In: Colloque DHNord2021 : Publier, partager, réutiliser les données de la recherche : les data papers et leurs enjeux ; https://hal.archives-ouvertes.fr/hal-03506077 ; Colloque DHNord2021 : Publier, partager, réutiliser les données de la recherche : les data papers et leurs enjeux, Nov 2021, virtuelle, France (2021)
|
|
BASE
|
|
Show details
|
|
|
| 16 |
A Logical Programming Language as an Instrument for Specifying and Verifying Dynamic Memory ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 17 |
Polynomial Graph Parsing with Non-Structural Reentrancies ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 19 |
Efficiently Testing Simon’s Congruence ...
|
|
|
|
Abstract:
Simon’s congruence ∼_k is a relation on words defined by Imre Simon in the 1970s and intensely studied since then. This congruence was initially used in connection to piecewise testable languages, but also found many applications in, e.g., learning theory, databases theory, or linguistics. The ∼_k-relation is defined as follows: two words are ∼_k-congruent if they have the same set of subsequences of length at most k. A long standing open problem, stated already by Simon in his initial works on this topic, was to design an algorithm which computes, given two words s and t, the largest k for which s∼_k t. We propose the first algorithm solving this problem in linear time O(|s|+|t|) when the input words are over the integer alphabet {1,…,|s|+|t|} (or other alphabets which can be sorted in linear time). Our approach can be extended to an optimal algorithm in the case of general alphabets as well. To achieve these results, we introduce a novel data-structure, called Simon-Tree, which allows us to construct a ... : LIPIcs, Vol. 187, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021), pages 34:1-34:18 ...
|
|
Keyword:
Efficient algorithms; Scattered factor; Simon’s congruence; Subsequence; Theory of computation → Design and analysis of algorithms; Theory of computation → Formal languages and automata theory
|
|
URL: https://drops.dagstuhl.de/opus/volltexte/2021/13679/
https://dx.doi.org/10.4230/lipics.stacs.2021.34
|
|
BASE
|
|
Hide details
|
|
|
|
|
