Related papers: Some Remarks on Almost Periodic Sequences and Lang…
A number of writers(Joseph Halpern and Fahiem Bacchus among them) have offered semantics for formal languages in which inferences concerning probabilities can be made. Our concern is different. This paper provides a formalization of…
The goal of this expository article is a fairly self-contained account of some averaging processes of functions along sequences of the form $(\alpha^n x)^{}_{n\in\mathbb{N}}$, where $\alpha$ is a fixed real number with $| \alpha | > 1$ and…
It is well-known that the dynamics of the Arnold circle map is phase-locked in regions of the parameter space called Arnold tongues. If the map is invertible, the only possible dynamics is either quasiperiodic motion, or phase-locked…
An almost periodic function in finite-dimensional space extends to a holomorphic bounded function in a tube domain with a cone in the base if and only if the spectrum belongs to the conjugate cone. Also, an almost periodic function in…
Language is contextual as meanings of words are dependent on their contexts. Contextuality is, concomitantly, a well-defined concept in quantum mechanics where it is considered a major resource for quantum computations. We investigate…
In 2006 T. Brown asked the following question: Given a non-periodic infinite word $x=x_1x_2x_3\cdots$ with values in a non-empty set $\mathbb{A},$ does there exist a finite coloring $\varphi: \mathbb{A}^+\rightarrow C$ relative to which $x$…
We establish a correspondence between (fragments of) $\mathcal{TEL}^\bigcirc$, a temporal extension of the $\mathcal{EL}$ description logic with the LTL operator $\bigcirc^k$, and some specific kinds of formal grammars, in particular,…
We identify a subclass of the regular commutative languages that is closed under the iterated shuffle, or shuffle closure. In particular, it is regularity-preserving on this subclass. This subclass contains the commutative group languages…
Many languages' inflectional morphological systems are replete with irregulars, i.e., words that do not seem to follow standard inflectional rules. In this work, we quantitatively investigate the conditions under which irregulars can…
We show that a set is almost periodic if and only if the associated exponential sum is concentrated in the minor arcs. Hence binary additive problems involving almost periodic sets can be solved using the circle method.
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
This paper considers quasi-reductivity - essentially, the property that an evaluation cannot get "stuck" due to a missing case in pattern matching - in the context of term rewriting with logical constraints.
We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets of patterns. In some cases we employ the graph of pattern…
The theory of abstract argumentation frameworks (afs) has, in the main, focused on finite structures, though there are many significant contexts where argumentation can be regarded as a process involving infinite objects. To address this…
In this work, we present basic results and applications of Stepanov pseudo almost periodic functions with measures. Using only the continuity assumption, we prove a new composition result of $\mu$-pseudo almost periodic functions in…
Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if it is an infinite Lyndon word. Here we extend this study to episturmian words (a natural…
A classical fact of the theory of almost periodic functions is the existence of their asymptotic distributions. In probabilistic terms, this means that if $f$ is a Besicovitch almost periodic function and $V$ is a random variable uniformly…
In this note we communicate some important remarks about the concepts of almost periodic time scales and almost periodic functions on time scales that are proposed by Wang and Agarwal in their recent papers (Adv. Difference Equ. (2015)…
We study the full language of quasigeodesics in Cayley graphs, with fixed error constants. We show that, given a non-virtually-cyclic nilpotent group or Baumslag--Solitar group, and any finite generating set, such languages fail to be…
The definition of period in finite-state Markov chains can be extended to regular languages by considering the transitions of DFAs accepting them. For example, the language $(\Sigma\Sigma)^*$ has period two because the length of a recursion…