3 |
Polynomial Graph Parsing with Non-Structural Reentrancies ...
|
|
|
|
BASE
|
|
Show details
|
|
4 |
The Linear Arrangement Library. A new tool for research on syntactic dependency structures ...
|
|
|
|
BASE
|
|
Show details
|
|
5 |
Complete Variable-Length Codes: An Excursion into Word Edit Operations
|
|
|
|
In: LATA 2020 ; https://hal.archives-ouvertes.fr/hal-02389403 ; LATA 2020, Mar 2020, Milan, Italy (2020)
|
|
BASE
|
|
Show details
|
|
8 |
The relationship between word complexity and computational complexity in subshifts
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02063174 ; 2019 (2019)
|
|
BASE
|
|
Show details
|
|
11 |
Avoiding or limiting regularities in words
|
|
|
|
In: Sequences, Groups and Number Theory ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-02083655 ; Sequences, Groups and Number Theory, pp.177-212, 2018, 978-3-319-69151-0. ⟨10.1007/978-3-319-69152-7_5⟩ (2018)
|
|
BASE
|
|
Show details
|
|
12 |
Tools for the analysis of noisy discrete curves ; Outils pour l'analyse des courbes discrètes bruitées
|
|
|
|
In: https://tel.archives-ouvertes.fr/tel-01947024 ; Géométrie algorithmique [cs.CG]. Université de Lorraine, 2018. Français. ⟨NNT : 2018LORR0159⟩ (2018)
|
|
BASE
|
|
Show details
|
|
14 |
K4-free Graphs as a Free Algebra
|
|
|
|
In: 42nd International Symposium on Mathematical Foundations of Computer Science ; https://hal.archives-ouvertes.fr/hal-01515752 ; 42nd International Symposium on Mathematical Foundations of Computer Science, Aug 2017, Aalborg, Denmark (2017)
|
|
BASE
|
|
Show details
|
|
17 |
Matroids Hitting Sets and Unsupervised Dependency Grammar Induction ...
|
|
|
|
BASE
|
|
Show details
|
|
18 |
Parsing with Traces: An $O(n^4)$ Algorithm and a Structural Representation ...
|
|
|
|
BASE
|
|
Show details
|
|
19 |
Palindromic language of thin discrete planes
|
|
|
|
In: ISSN: 1879-2294 ; EISSN: 0304-3975 ; Theoretical Computer Science ; https://hal.archives-ouvertes.fr/hal-01262289 ; Theoretical Computer Science, Elsevier, 2016, pp.101-108. ⟨10.1016/j.tcs.2015.11.023⟩ (2016)
|
|
Abstract:
International audience ; We work on the Réveillès hyperplane P(v,0,ω) with normal vector v ∈ R^d , shift μ = 0 and thickness ω ∈ R . Such a hyperplane is connected as soon as ω is greater than some value Ω(v,0) , called the connecting thickness of v with null shift. In the case where v satisfies the so called Kraaikamp and Meester criterion, at the connecting thickness the hyperplane has very specific properties. First of all the adjacency graph of the voxels forms a tree. This tree appeared in many works both in discrete geometry and in discrete dynamical systems. In addition, it is well known that for a finite coding of length n of discrete lines, the number of palindromes in the language is exactly n + 1. We extend this notion of language to labeled trees and we compute the number of distinct palindromes. In fact for our voxel adjacency trees with n letters we show that the number of palindromes in the language is also n + 1. This result establishes a first link between combinatorics on words, palindromic languages, voxel adjacency trees and connecting thickness of Réveillès hyperplanes. It also provides a better understanding of the combinatorial structure of discrete planes.
|
|
Keyword:
[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]; Discrete planes; Palindromic languages; Voxel adjacency trees
|
|
URL: https://doi.org/10.1016/j.tcs.2015.11.023 https://hal.archives-ouvertes.fr/hal-01262289
|
|
BASE
|
|
Hide details
|
|
20 |
Synchronizing Relations on Words
|
|
|
|
In: ISSN: 1432-4350 ; EISSN: 1433-0490 ; Theory of Computing Systems ; https://hal.archives-ouvertes.fr/hal-01778459 ; Theory of Computing Systems, Springer Verlag, 2015, 57 (2), pp.287 - 318. ⟨10.1007/s00224-014-9584-2⟩ (2015)
|
|
BASE
|
|
Show details
|
|
|
|