Related papers: The semibicategory of Moore automata

We introduce essential subtrees for terms (trees) and tree automata . There are some results concerning independent sets of subtrees and separable sets for a tree and an automaton.

In this paper we initiate the study of $\aleph_0$-categorical semigroups, where a countable semigroup $S$ is $\aleph_0$-categorical if, for any natural number $n$, the action of its group of automorphisms Aut $S$ on $S^n$ has only finitely…

A decidability proof for bisimulation equivalence of first-order grammars is given. It is an alternative proof for a result by S\'enizergues (1998, 2005) that subsumes his affirmative solution of the famous decidability question for…

Let $A$ be a noetherian ring, $I$ an ideal of $A$ and $N\subset M$ finitely generated $A$-modules. The relation type of $I$ with respect to $M$, denoted by ${\bf rt}\,(I;M)$, is the maximal degree in a minimal generating set of relations of…

In [6], a constraint on invariant measures of bi-permutative cellular automata has been observed: fixed values at the positive indices determine almost-surely a uniform conditional probability on the subset of values of positive conditional…

A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene's theorem and Kleene algebra, were recently proposed by a subset of the authors of this paper. Examples of the systems…

We want to replace categories, functors and natural transformations by categories, open functors and open natural transformations. In analogy with open dynamical systems, the adjective open is added here to mean that some external…

Let $R$ and $S$ be rings and $_R\omega_S$ a semidualizing bimodule. We prove that there exists a Morita equivalence between the class of $\infty$-$\omega$-cotorsionfree modules and a subclass of the class of $\omega$-adstatic modules. Also…

Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups…

Given a monoid $(M,\varepsilon,\cdot )$ it is shown that a subset $A\subseteq M$ is recognizable in the sense of automata theory if and only if the $\varphi $-rank of $x=x$ is zero in the first-order theory $\operatorname{Th}(M,\varepsilon…

Let $S$ be a semigroup, $\Lambda$ a non-empty set and $P$ a mapping of $\Lambda$ into $S$. The set $S\times \Lambda$ together with the operation $\circ _P$ defined by $(s, \lambda)\circ _P(t, \mu )=(sP(\lambda)t, \mu )$ form a semigroup…

To a smooth and proper morphism $\mathcal{X}\to U$ with quasicompact semiseparated target we associate a sheaf in the \'etale topology, which takes an affine $U$-scheme $V$ to the set of $V$-linear semiorthogonal decompositions (of fixed…

For $d\geq 1$, we define semibricks and wide subcategories in the $d$-extended hearts of bounded $t$-structures on a triangulated category. We show that these semibricks are in bijection with finite-length wide subcategories. When the…

This work aims at further investigations on the work of Giambruno and Restivo to find the rank of the intersection of two finitely generated submonoids of a free monoid. In this connection, we obtain the rank of a finitely generated…

We study trees where each successor set is equipped with some additional structure. We introduce a family of automaton models for such trees and prove their equivalence to certain fixed-point logics. As a consequence we obtain…

We establish several extensions of the well-known Garden of Eden theorem for non-uniform cellular automata over the full shifts and over amenable group universes. In particular, our results describe quantitatively the relations between the…

The minimal number of inputs in the local function of a non-trivial cellular automaton is two. Such a function can be viewed as as a kind of binary operation. If this operation is associative, it forms, together with the set of states, a…

Some of the most interesting and important results concerning quantum finite automata are those showing that they can recognize certain languages with (much) less resources than corresponding classical finite automata…

In this paper, we look at an unambiguous version of Simon's forest factorization theorem, a very deep result which has wide connections in algebra, logic and automata. Given a morphism $\varphi$ from $\Sigma^+$ to a finite semigroup $S$, we…

We introduce a new measure on regular languages: their nondeterministic syntactic complexity. It is the least degree of any extension of the `canonical boolean representation' of the syntactic monoid. Equivalently, it is the least number of…