Related papers: McCammond's normal forms for free aperiodic semigr…
Let K be an algebraically closed field of characteristic zero, endowed with a complete nonarchimedean norm. Let X be a K-rigid analytic variety and \Sigma a semianalytic subset of X. Then the closure of \Sigma in X with respect to the…
We present a type inference algorithm for lambda-terms in Elementary Affine Logic using linear constraints. We prove that the algorithm is correct and complete.
The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…
The normal form theory for polynomial vector fields is extended to those for $C^\infty$ vector fields vanishing at the origin. Explicit formulas for the $C^\infty$ normal form and the near identity transformation which brings a vector field…
We describe a novel algorithm for random sampling of freely reduced words equal to the identity in a finitely presented group. The algorithm is based on Metropolis Monte Carlo sampling. The algorithm samples from a stretched Boltzmann…
Here we define a new unification algorithm for terms interpreted in semantic domains denoted by a subclass of regular types here called deterministic regular types. This reflects our intention not to handle the semantic universe as a…
In this work the existence of periodic solutions is studied for the Hamiltonian functions (Formula presented.) where the first term consist of a harmonic oscillator and the second term are homogeneous polynomials of degree 5 defined by two…
We show that the Word Problem in finitely generated subgroups of $\textsf{GL}_d(\mathbb{Z})$ can be solved in linear average-case complexity. This is done under the bit-complexity model, which accounts for the fact that large integers are…
We implement a decision procedure for answering questions about a class of infinite words that might be called (for lack of a better name) "Fibonacci-automatic". This class includes, for example, the famous Fibonacci word f = 01001010...,…
Green [Geometric and Functional Analysis 15 (2005), 340--376] established a version of the Szemer\'edi Regularity Lemma for abelian groups and derived the Removal Lemma for abelian groups as its corollary. We provide another proof of his…
Probabilistic puzzles can be confusing, partly because they are formulated in natural languages - full of unclarities and ambiguities - and partly because there is no widely accepted and intuitive formal language to express them. We propose…
We define a new class of languages of $\omega$-words, strictly extending $\omega$-regular languages. One way to present this new class is by a type of regular expressions. The new expressions are an extension of $\omega$-regular expressions…
We consider the infinite one-sided sequence generated by the period-doubling substitution $\sigma(a,b)=(ab,aa)$, denoted by $\mathbb{D}$. Since $\mathbb{D}$ is uniformly recurrent, each factor $\omega$ appears infinite many times in the…
The work investigates the problem of whether a context-free language is a subset of a group language. A.~V. Anisimov has shown that the problem of determining the unambiguity of finite automata is a special case of this problem. Then the…
We present a framework which allows a uniform approach to the recently introduced concept of pseudo-repetitions on words in the morphic case. This framework is at the same time more general and simpler. We introduce the concept of a…
An {\omega}-language is a set of infinite words over a finite alphabet X. We consider the class of recursive {\omega}-languages, i.e. the class of {\omega}-languages accepted by Turing machines with a B\"uchi acceptance condition, which is…
In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…
We present a new approach to formal language theory using Kolmogorov complexity. The main results presented here are an alternative for pumping lemma(s), a new characterization for regular languages, and a new method to separate…
We stress the potential usefulness of renormalization group invariants. Especially particular combinations thereof could for instance be used as probes into patterns of supersymmetry breaking in the MSSM at inaccessibly high energies. We…
This paper considers the fundamental problem of learning a complete (orthogonal) dictionary from samples of sparsely generated signals. Most existing methods solve the dictionary (and sparse representations) based on heuristic algorithms,…