Results 31 to 40 of about 1,318,046 (112)
A characterization of fine words over a finite alphabet [PDF]
, 2006 To any infinite word t over a finite alphabet A we can associate two infinite words min (t) and max (t) such that any prefix of min (t) (resp. max (t)) is the lexicographically smallest (resp. greatest) amongst the factors of t of the same length. We say
Glen, Amy, Glen, A.
core +1 more source
On minimal Sturmian partial words
Discrete Applied Mathematics, 2011 The subword complexity \(p_w (n)\) of a word \(w\) is the function that maps \(n\) to the number of distinct length-\(n\) factors occurring in \(w\). A partial word is a word with a ``don't care'' symbol \(\diamond\) that matches every other symbol. The notion of subword complexity can be extended to partial words \(w\) by counting the total number of ...
Blanchet-Sadri, Francine, Lensmire, John
openaire +5 more sources
Directive words of episturmian words: equivalences and normalization [PDF]
, 2008 Episturmian morphisms constitute a powerful tool to study episturmian words. Indeed, any episturmian word can be infinitely decomposed over the set of pure episturmian morphisms.
Amy Glen +8 more
core +1 more source
Discrete Dynamics in Nature and Society, Volume 2018, Issue 1, 2018., 2018 This paper is concerned with boundary value problems for a fourth‐order nonlinear difference equation. Via variational methods and critical point theory, sufficient conditions are obtained for the existence of at least two nontrivial solutions, the existence of n distinct pairs of nontrivial solutions, and nonexistence of solutions.
Xia Liu +3 more
wiley +1 more source
The Existence and Structure of Rotational Systems in the Circle
Abstract and Applied Analysis, Volume 2018, Issue 1, 2018., 2018 By a rotational system, we mean a closed subset X of the circle, T=R/Z, together with a continuous transformation f : X → X with the requirements that the dynamical system (X, f) be minimal and that f respect the standard orientation of T. We show that infinite rotational systems (X, f), with the property that map f has finite preimages, are extensions
Jayakumar Ramanathan, Simeon Reich
wiley +1 more source
Solvability of Nth Order Linear Boundary Value Problems
International Journal of Differential Equations, Volume 2015, Issue 1, 2015., 2015 This paper presents a method that provides necessary and sufficient conditions for the existence of solutions of nth order linear boundary value problems. The method is based on the recursive application of a linear integral operator to some functions and the comparison of the result with these same functions.
P. Almenar, L. Jódar, Peiguang Wang
wiley +1 more source
Dejean’s conjecture and Sturmian words
European Journal of Combinatorics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Morteza Mohammad Noori, James D. Currie
openaire +1 more source
Open and Closed Prefixes of Sturmian Words [PDF]
, 2013 A word is closed if it contains a proper factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open.
Alessandro De Luca +4 more
core +1 more source
$\mathcal{S}$-adic characterization of minimal dendric shifts [PDF]
Discrete Mathematics & Theoretical Computer ScienceDendric shifts are defined by combinatorial restrictions of the extensions of the words in their languages. This family generalizes well-known families of shifts such as Sturmian shifts, Arnoux-Rauzy shifts and codings of interval exchange ...
France Gheeraert, Julien Leroy
doaj +1 more source
On Constants in Nonoscillation Criteria for Half‐Linear Differential Equations
Abstract and Applied Analysis, Volume 2011, Issue 1, 2011., 2011 We study the half‐linear differential equation (r(t)Φ(x′)) ′ + c(t)Φ(x) = 0, where Φ(x) = |x|p−2x, p > 1. Using the modified Riccati technique, we derive new nonoscillation criteria for this equation. The results are closely related to the classical Hille‐Nehari criteria and allow to replace the fixed constants in known nonoscillation criteria by a ...
Simona Fišnarová +2 more
wiley +1 more source