Related papers: A new estimate on complexity of binary generalized…
We investigate the duality between algebraic and coalgebraic recognition of languages to derive a generalization of the local version of Eilenberg's theorem. This theorem states that the lattice of all boolean algebras of regular languages…
The generalized binary sequences of order 2 have been used to construct good binary cyclic codes [4]. The linear complexity of these sequences has been computed in [2]. The autocorrelation values of such sequences have been determined in…
Given a regular language L, we effectively construct a unary semigroup that recognizes the topological closure of L in the free unary semigroup relative to the variety of unary semigroups generated by the pseudovariety R of all finite…
This paper concerns a specific class of strict standard episturmian words whose directive words resemble those of characteristic Sturmian words. In particular, we explicitly determine all integer powers occurring in such infinite words,…
Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable relations. We provide a systematic study of the decidability of…
Two new generalized Fibonacci number summation identities are stated and proved, and two other new generalized Fibonacci number summation identities are derived from these, of which two special cases are already known in literature.
Word sense disambiguation primarily addresses the lexical ambiguity of common words based on a predefined sense inventory. Conversely, proper names are usually considered to denote an ad-hoc real-world referent. Once the reference is…
We observe that the nonstandard finite cardinality of a definable set in a strongly minimal pseudofinite structure D is a polynomial over the integers in the nonstandard finite cardinality of D. We conclude that D is unimodular, hence also…
In the BCSS model of real number computations we prove a concrete and explicit semi-decidable language to be undecidable yet not reducible from (and thus strictly easier than) the real Halting Language. This solution to Post's Problem over…
Generalized Zeckendorf decompositions are expansions of integers as sums of elements of solutions to recurrence relations. The simplest cases are base-$b$ expansions, and the standard Zeckendorf decomposition uses the Fibonacci sequence.…
Quantifying uncertainty in word embeddings is crucial for reliable inference from textual data. However, existing Bayesian methods such as Hamiltonian Monte Carlo (HMC) and mean-field variational inference (MFVI) are either computationally…
Generalized likelihoods are commonly used to obtain consistent estimators with attractive computational and robustness properties. Formally, any generalized likelihood can be used to define a generalized posterior distribution, but an…
In the constrained synchronization problem we ask if a given automaton admits a synchronizing word coming from a fixed regular constraint language. We show that intersecting a given constraint language with an ideal language decreases the…
We consider two {seemingly} different definitions of infinite words which contain {the} utmost number of palindromes. We show that these two definitions coincide. {The keynote of the proof is a meticulous inspection of properties of…
In this paper, firstly, we define the Generalized Tribonacci-Lucas numbers. In addition, by also defining circulant matrices C_{n}(G) and C_{n}(S) whose entries are Generalized Tribonacci and Generalized Tribonacci-Lucas numbers, we compute…
In many applications of natural language processing (NLP) it is necessary to determine the likelihood of a given word combination. For example, a speech recognizer may need to determine which of the two word combinations ``eat a peach'' and…
Antichain based semantics for general rough sets were introduced recently by the present author. In her paper two different semantics, one for general rough sets and another for general approximation spaces over quasi-equivalence relations,…
A universal cycle, or u-cycle, for a given set of words is a circular word that contains each word from the set exactly once as a contiguous subword. The celebrated de Bruijn sequences are a particular case of such a u-cycle, where a set in…
Our method of density elimination is generalized to the non-commutative substructural logic GpsUL*. Then the standard completeness of GpsUL* follows as a lemma by virtue of previous work by Metcalfe and Montagna. This result shows that…
We study the sequences of numbers corresponding to lambda terms of given sizes, where the size is this of lambda terms with de Bruijn indices in a very natural model where all the operators have size 1. For plain lambda terms, the sequence…