DE eng

Search in the Catalogues and Directories

Page: 1 2 3
Hits 1 – 20 of 45

1
Formal Metatheory of Second-Order Abstract Syntax ...
BASE
Show details
2
Boolean proportions ...
Antić, Christian. - : arXiv, 2021
BASE
Show details
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
6
Continuous Fuzzy Transform as Integral Operator ...
Patanè, Giuseppe. - : arXiv, 2020
BASE
Show details
7
The optimality of syntactic dependency distances ...
BASE
Show details
8
The relationship between word complexity and computational complexity in subshifts
In: https://hal.archives-ouvertes.fr/hal-02063174 ; 2019 (2019)
Abstract: We prove several results about the relationship between the word complexity function of a subshift and the set of Turing degrees of points of the subshift, which we call the Turing spectrum. Among other results, we show that a Turing spectrum can be realized via a subshift of linear complexity if and only if it consists of the union of a finite set and a finite number of cones, that a Turing spectrum can be realized via a subshift of exponential complexity (i.e. positive entropy) if and only if it contains a cone, and that every Turing spectrum which either contains degree 0 or is a union of cones is realizable by subshifts with a wide range of 'intermediate' complexity growth rates between linear and exponential.
Keyword: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]; [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]; [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]; [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]
URL: https://hal.archives-ouvertes.fr/hal-02063174/document
https://hal.archives-ouvertes.fr/hal-02063174
https://hal.archives-ouvertes.fr/hal-02063174/file/draft.pdf
BASE
Hide details
9
Edge crossings in random linear arrangements ...
BASE
Show details
10
Memory limitations are hidden in grammar ...
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
Nasser, Hayat. - : HAL CCSD, 2018
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
13
Trees in the Real Field ...
Betti, Alessandro; Gori, Marco. - : arXiv, 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
15
Approximations from Anywhere and General Rough Sets ...
Mani, A.. - : arXiv, 2017
BASE
Show details
16
Embedded-Graph Theory ...
Yokoyama, Atsushi. - : arXiv, 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)
BASE
Show 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

Page: 1 2 3

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
45
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern