Results 11 to 20 of about 649 (143)
Eulerian entropy and non-repetitive subword complexity
Theoretical Computer Science, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +2 more sources
Applying a uniform marked morphism to a word [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 We describe the relationship between different parameters of the initial word and its image obtained by application of a uniform marked morphism. The functions described include the subword complexity, frequency of factors, and the recurrence function ...
Anna Frid
doaj +3 more sources
The subword complexity of polynomial subsequences of the Thue–Morse sequence
Comptes Rendus. Mathématique, 2022 Let $\mathbf{t}=(t(n))_{n\geqslant 0}$ be the Thue–Morse sequence in $0,1$. J.-P. Allouche and J. Shallit asked in 2003 whether the subword complexity of the subsequence $(t(n^2))_{n\geqslant 0}$ attains the maximal value.
Shen, Zhao
doaj +1 more source
The Maximal Subword Complexity of Quasiperiodic Infinite Words [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We provide an exact estimate on the maximal subword complexity for quasiperiodic infinite words. To this end we give a representation of the set of finite and of infinite words having a certain quasiperiod q via a finite language derived from q.
Ronny Polley, Ludwig Staiger
doaj +1 more source
Electronic Proceedings in Theoretical Computer Science, 2011 Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are said to be full words (or simply words). Given an infinite partial word w,
Francine Blanchet-Sadri +4 more
doaj +1 more source
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
On infinite permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We define an infinite permutation as a sequence of reals taken up to the order, or, equivalently, as a linear ordering of a finite or countable set. Then we introduce and characterize periodic permutations; surprisingly, for each period $t$ there is an ...
Dmitri G. Fon-Der-Flaass, Anna E. Frid
doaj +1 more source
EURASIP Journal on Audio, Speech, and Music Processing, 2023 This article presents the research work on improving speech recognition systems for the morphologically complex Malayalam language using subword tokens for language modeling.
Kavya Manohar, Jayan A R, Rajeev Rajan
doaj +1 more source
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 +1 more source
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