Related papers: Star-free languages and local divisors

We offer a direct proof of an elementary result concerning cohomological periods. As a corollary we show that given a finitely generated stably free resolution of Z over a finite group, two of its modules are free.

Regular languages -- the languages accepted by deterministic finite automata -- are known to be precisely the languages recognized by finite monoids. This characterization is the origin of algebraic language theory. In this paper, we…

We consider rational power series over an alphabet $\Sigma$ with coefficients in a ordered commutative semiring $K$ and characterize them as the free ordered $K$-semialgebras in various classes of ordered $K$-semialgebras equipped with a…

We determine the fixed locus of the anticanonical complete linear system of a given anticanonical rational surface. The case of a geometrically ruled rational surface is fully studied, e.g., the monoid of numerically effective divisor…

Context-free language theory is a subject of high importance in computer language processing technology as well as in formal language theory. This paper presents a formalization, using the Coq proof assistant, of fundamental results related…

It has been conjectured that the Parikh (commutative) image of every language over an infinite alphabet recognized by an automaton with registers is defined by a rational expression. This conjecture is known to hold for all languages…

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

We give a short proof, using profinite techniques, that idempotent pointlikes, stable pairs and triples are decidable for the pseudovariety of aperiodic monoids. Stable pairs are also described for the pseudovariety of all finite monoids.

We say that a monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N\ge 2$ is monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of ${\mathbb…

We prove that monoids $\mathrm{Mon}\langle a,b,c,d : a^nb=0, ac=1, db=1, dc=1, dab=1, da^2b=1, \ldots, da^{n-1}b=1\rangle$ are congruence-free for all $n\geq 1$. This provides a new countable family of finitely presented congruence-free…

We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the…

We consider Sch\"odinger operators on the half-line, both discrete and continuous, and show that the absence of bound states implies the absence of embedded singular spectrum. More precisely, in the discrete case we prove that if $\Delta +…

In this paper we consider Schr\"oodinger operators with potentials of order zero on asymptotically conic manifolds. We prove the existence and the completeness of the wave operators with a naturally defined free Hamiltonian.

Let $L_{K}(A)$ be the free Lie algebra on a finite alphabet $A$ over a commutative ring $K$ with unity. For a word $u$ in the free monoid $A^{*}$ let $\tilde{u}$ denote its reversal. Two words in $A^{*}$ are called twin (resp. anti-twin) if…

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…

We study several rigidity properties of $p$-adic local systems on a smooth rigid analytic space $X$ over a $p$-adic field. We prove that the monodromy of the log isocrystal attached to a $p$-adic local system is ''rigid'' along irreducible…

We approach the study of complete bifix decodings of (uniformly) recurrent languages with the help of the free profinite monoid. We show that the complete bifix decoding of a uniformly recurrent language $F$ by an $F$-charged rational…

Schauder's theorem asserts that a bounded linear operator between Banach spaces is compact if ad only if its adjoint is. We give a new proof of this result, which is both short and completely elementary in the sense that it does not depend…

An open problem posed by Milner asks for a proof that a certain axiomatisation, which Milner showed is sound with respect to bisimilarity for regular expressions, is also complete. One of the main difficulties of the problem is the lack of…

Motivated by the question of which completely regular semigroups have context-free word problem, we show that for certain classes of languages $\mathfrak{C}$(including context-free), every completely regular semigroup that is a union of…