Results 51 to 60 of about 8,270 (198)
On subword complexity functions
Discrete Applied Mathematics, 1984 The author finds a polynomial formula for the subword complexity function of a cyclic language. A characterization of context-free languages with exponential subword complexity is derived by appropriately using the pumping lemma.
openaire +2 more sources
Sequences With Subword Complexity 2n
Journal of Number Theory, 1994 The complexity of an infinite sequence taking finitely many values is the function \(n \to P(n)\), where \(P(n)\) is the number of blocks of length \(n\) occurring in the sequence (the usual term for ``blocks'' is ``factors'' in the European terminology and ``subwords'' in the American terminology). One can be interested in the asymptotic behaviour of \
openaire +2 more sources
Subword complexes and 2-truncated cubes [PDF]
Russian Mathematical Surveys, 2014 For a Coxeter element $c$ of a finite Coxeter group, we consider a family of subword complexes parameterized by reduced expressions of the longest element. This family generalizes $c-$cluster complexes. We describe vertices of these complexes in terms of roots of the corresponding root system.
openaire +2 more sources
Spectral Continuity for Aperiodic Quantum Systems II. Periodic Approximations in 1D
, 2018 The existence and construction of periodic approximations with convergent spectra is crucial in solid state physics for the spectral study of corresponding Schr\"odinger operators. In a forthcoming work [9] (arXiv:1709.00975) this task was boiled down to
Beckus, Siegfried +2 more
core +1 more source
, 2015 Given a finitely generated free monoid $X$ and a morphism $\phi : X\to X$, we show that one can construct an algebra, which we call an iterative algebra, in a natural way.
Bell, Jason P., Madill, Blake W.
core +1 more source
Subword complexes via triangulations of root polytopes [PDF]
Algebraic Combinatorics, 2018 Subword complexes are simplicial complexes introduced by Knutson and Miller to illustrate the combinatorics of Schubert polynomials and determinantal ideals. They proved that any subword complex is homeomorphic to a ball or a sphere and asked about their geometric realizations.
Escobar, Laura, Mészáros, Karola
openaire +2 more sources
Internal Pattern Matching Queries in a Text and Applications
, 2014 We consider several types of internal queries: questions about subwords of a text. As the main tool we develop an optimal data structure for the problem called here internal pattern matching.
Kociumaka, Tomasz +3 more
core +1 more source
A Hopf algebra of subword complexes
Advances in Mathematics, 2017 Several color figures, 31 ...
Nantel Bergeron, Cesar Ceballos
openaire +2 more sources
Advanced Materials, EarlyView.Magnetic tunnel junctions (MTJs) using MgO tunnel barriers face challenges of high resistance‐area product and low tunnel magnetoresistance (TMR). To discover alternative materials, Literature Enhanced Ab initio Discovery (LEAD) is developed. The LEAD‐predicted materials are theoretically evaluated, showing that MTJs with dusting of ScN or TiN on ...
Sabiq Islam +6 more
wiley +1 more source
IEEE AccessSindhi word segmentation is a challenging task due to space omission and insertion issues. The Sindhi language itself adds to this complexity. It’s cursive and consists of characters with inherent joining and non-joining properties, independent of
Wazir Ali +5 more
doaj +1 more source