1 |
SEMIOTAX: EQUATIONAL MODELS FOR THE LINGUISTIC SENTENCE AND THE 'COMPUTATIONAL THOUGHT'
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-03639891 ; 2022 (2022)
|
|
BASE
|
|
Show details
|
|
2 |
Pemanfaatan Bank-data Digital Dwibahasa dalam Kajian Terjemahan: Studi kasus padanan bahasa Indonesia untuk verba sinonim bahasa Inggris ROB & STEAL ...
|
|
|
|
BASE
|
|
Show details
|
|
3 |
Pemanfaatan Bank-data Digital Dwibahasa dalam Kajian Terjemahan: Studi kasus padanan bahasa Indonesia untuk verba sinonim bahasa Inggris ROB & STEAL ...
|
|
|
|
BASE
|
|
Show details
|
|
4 |
ProQuest Historical Newspapers Collections: The New York Times (1851-1936) and The Washington Post (1877-1934) ...
|
|
|
|
BASE
|
|
Show details
|
|
5 |
ProQuest Historical Newspapers Collections: The New York Times (1851-1936) and The Washington Post (1877-1934) ...
|
|
|
|
BASE
|
|
Show details
|
|
6 |
EXPLICIT HISTORICAL, PHONETIC, AND PHONOLOGICAL INSTRUCTION IN SECOND LANGUAGE ACQUISITION ...
|
|
|
|
BASE
|
|
Show details
|
|
7 |
EXPLICIT HISTORICAL, PHONETIC, AND PHONOLOGICAL INSTRUCTION IN SECOND LANGUAGE ACQUISITION ...
|
|
|
|
BASE
|
|
Show details
|
|
8 |
Paradigmatic Uniformity: Evidence from Heritage Speakers of Spanish ...
|
|
|
|
BASE
|
|
Show details
|
|
9 |
Paradigmatic Uniformity: Evidence from Heritage Speakers of Spanish ...
|
|
|
|
BASE
|
|
Show details
|
|
10 |
Diagnostic Accuracy of Grammatical Measures (Guo & Schneider, 2016) ...
|
|
|
|
BASE
|
|
Show details
|
|
11 |
Diagnostic Accuracy of Grammatical Measures (Guo & Schneider, 2016) ...
|
|
|
|
BASE
|
|
Show details
|
|
13 |
A theoretical and experimental analysis of BWT variants for string collections ...
|
|
|
|
BASE
|
|
Show details
|
|
14 |
String Rearrangement Inequalities and a Total Order Between Primitive Words ...
|
|
|
|
Abstract:
We study the following rearrangement problem: Given $n$ words, rearrange and concatenate them so that the obtained string is lexicographically smallest (or largest, respectively). We show that this problem reduces to sorting the given words so that their repeating strings are non-decreasing (or non-increasing, respectively), where the repeating string of a word $A$ refers to the infinite string $AAA\ldots$. Moreover, for fixed size alphabet $Σ$, we design an $O(L)$ time sorting algorithm of the words (in the mentioned orders), where $L$ denotes the total length of the input words. Hence we obtain an $O(L)$ time algorithm for the rearrangement problem. Finally, we point out that comparing primitive words via comparing their repeating strings leads to a total order, which can further be extended to a total order on the finite words (or all words). ...
|
|
Keyword:
68R15; Data Structures and Algorithms cs.DS; F.2.2; FOS Computer and information sciences
|
|
URL: https://arxiv.org/abs/2204.11213 https://dx.doi.org/10.48550/arxiv.2204.11213
|
|
BASE
|
|
Hide details
|
|
15 |
Dynamic Suffix Array with Polylogarithmic Queries and Updates ...
|
|
|
|
BASE
|
|
Show details
|
|
16 |
An Optimal-Time RLBWT Construction in BWT-runs Bounded Space ...
|
|
|
|
BASE
|
|
Show details
|
|
17 |
Secondary Structures of Proteins Follow Menzerath–Altmann Law
|
|
|
|
In: International Journal of Molecular Sciences; Volume 23; Issue 3; Pages: 1569 (2022)
|
|
BASE
|
|
Show details
|
|
18 |
Suffix tree-based linear algorithms for multiple prefixes, single suffix counting and listing problems ...
|
|
|
|
BASE
|
|
Show details
|
|
19 |
Reduction ratio of the IS-algorithm: worst and random cases ...
|
|
|
|
BASE
|
|
Show details
|
|
20 |
2021 Internet as editing tool for non-English speaking researchers.docx ...
|
|
|
|
BASE
|
|
Show details
|
|
|
|