Results 11 to 20 of about 1,541,664 (157)
Arithmetical subword complexity of automatic sequences
CoRR, 2023 We fully classify automatic sequences $a$ over a finite alphabet $Ω$ with the property that each word over $Ω$ appears is $a$ along an arithmetic progression. Using the terminology introduced by Avgustinovich, Fon-Der-Flaass and Frid, these are the automatic sequences with the maximal possible arithmetical subword complexity.
Jakub Konieczny, Clemens Müllner
core +11 more sources
Decision Trees for Binary Subword-Closed Languages
Entropy, 2023 In this paper, we study arbitrary subword-closed languages over the alphabet {0,1} (binary subword-closed languages). For the set of words L(n) of the length n belonging to a binary subword-closed language L, we investigate the depth of the decision ...
Mikhail Moshkov
doaj +2 more sources
On state complexity for subword-closed languages [PDF]
CoRRThis paper investigates the state complexities of subword-closed and superword-closed languages, comparing them to regular languages. We focus on the square root operator and the substitution operator. We establish an exponential lower bound for superword-closed languages for the k-th root.
Guyot, Jérôme
core +5 more sources
Infinite words with linear subword complexity [PDF]
Theoretical Computer Science, 1989 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mignosi, Filippo
openaire +5 more sources
Slide complexes and subword complexes [PDF]
Russian Mathematical Surveys, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Smirnov, Evgeny Yu., Tutubalina, Anna A.
openaire +4 more sources
Subword Complexes and Kalai's Conjecture on Reconstruction of Spheres. [PDF]
Discrete Comput GeomAbstract A famous theorem in polytope theory states that the combinatorial type of a simplicial polytope is completely determined by its facet-ridge graph. This celebrated result was proven by Blind and Mani (Aequationes Math 34(2–3):287–297, 1987, https://doi.org/10.1007/BF01830678), via a non-constructive proof using topological tools from ...
Ceballos C, Doolittle J.
europepmc +4 more sources
Graph Logics with Rational Relations [PDF]
Logical Methods in Computer Science, 2013 We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications.
Pablo Barcelo +2 more
doaj +1 more source
Morphology Matters: A Multilingual Language Modeling Analysis
Transactions of the Association for Computational Linguistics, 2021 Prior studies in multilingual language modeling (e.g., Cotterell et al., 2018; Mielke et al., 2019) disagree on whether or not inflectional morphology makes languages harder to model. We attempt to resolve the disagreement and extend those studies.
Hyunji Hayley Park +5 more
doaj +1 more source
Institutional complexity is complexity with an adjective
, 2021 A review of the studies on institutional complexity reveals that the many definitions of institutional complexity and related concepts share similarities with the understanding of complexity and complex systems of complexity science. Yet few publications
Papin, Marielle
core +1 more source
What neural networks know about linguistic complexity
Russian Journal of Linguistics, 2022 Linguistic complexity is a complex phenomenon, as it manifests itself on different levels (complexity of texts to sentences to words to subword units), through different features (genres to syntax to semantics), and also via different tasks (language ...
Serge Aleksandrovich Sharoff
doaj +1 more source