Related papers: Finite transducers for divisibility monoids
We establish a general normal subgroup theorem for commensurators of lattices in locally compact groups. While the statement is completely elementary, its proof, which rests on the original strategy of Margulis in the case of higher rank…
In this paper we consider the notion of normality of sequences in shifts of finite type. A sequence is normal if the frequency of each block exists and is equal to the Parry measure of the block. We give a characterization of normality in…
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes with a distributed control structure called asynchronous automaton. This paper gives a polynomial algorithm for…
We show that equivalence of deterministic top-down tree-to-string transducers is decidable, thus solving a long standing open problem in formal language theory. We also present efficient algorithms for subclasses: polynomial time for total…
Let $M$ be a cancellative and commutative monoid (written additively). The monoid $M$ is atomic if every non-invertible element can be written as a sum of irreducible elements (often called atoms in the literature). Weaker versions of…
This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…
Monadic decomposibility --- the ability to determine whether a formula in a given logical theory can be decomposed into a boolean combination of monadic formulas --- is a powerful tool for devising a decision procedure for a given logical…
We show that any graph product of residually finite monoids is residually finite. As a special case we obtain that any free product of residually finite monoids is residually finite. The corresponding results for graph products of…
A modular or distributive lattice is `diamond-colored' if its order diagram edges are colored in such a way that, within any diamond of edges, parallel edges have the same color. Such lattices arise naturally in combinatorial representation…
A Puiseux monoid is a submonoid of $(\mathbb{Q},+)$ consisting of nonnegative rational numbers. Although the operation of addition is continuous with respect to the standard topology, the set of irreducibles of a Puiseux monoid is, in…
The paper presents an elaborated and simplified version of the structural result for branching bisimilarity on normed BPA (Basic Process Algebra) processes that was the crux of a conference paper by Czerwinski and Jancar (arxiv 7/2014 and…
A resolution of the intersection of a finite number of subgroups of an abelian group by means of their sums is constructed, provided the lattice generated by these subgroups is distributive. This is used for detecting singularities of…
Distributed automata are finite-state machines that operate on finite directed graphs. Acting as synchronous distributed algorithms, they use their input graph as a network in which identical processors communicate for a possibly infinite…
We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups and their relatives acting on monoids of set partitions. The nature of our monoids…
Monadic second order logic is the expansion of first order logic by quantifiers ranging over unary relations. We study the shared monadic second order theory of finite linear orders, i.e. the pseudofinite monadic second order theory of…
We study succinctness as a measure of the expressive power of transformers. Succinctness -- how compactly a formalism can describe a language relative to other formalisms -- is a classical notion in logic and automata theory. We prove that…
We use magnetic flux-tubes to stabilize zero-energy modes in a lattice realization of a 2-dimensional superconductor from class D of classification table of topological condensed matter systems. The zero modes are exchanged by slowly…
It is shown that a finite monoid can have an infinite irredundant basis of equations.
In this article, we continue the study of monadic distributive lattices (or m-lattices) which are a natural generalization of monadic Heyting algebras, introduced by Monteiro and Varsavsky and developed exhaustively by Bezhanishvili. First,…
We completely classify all neutral or costandard elements in the lattice $\mathbb{MON}$ of all monoid varieties. Further, we prove that an arbitrary upper-modular element of $\mathbb{MON}$ except the variety of all monoids is either a…