Abstract We show the decidability of finite sequentiality problem for unambiguous max-plus tree automata. A automaton is called if there at most one accepting run on every tree. The asks whether a given automaton, exist finitely many deterministic automata whose pointwise maximum equivalent to automaton.

Abstract We show that the finite sequentiality problem is decidable for finitely ambiguous max-plus tree automata. A automaton a weighted over semiring. called if number of accepting runs on every bounded by global constant. The asks whether given automaton, there exist many deterministic automata whose pointwise maximum equivalent to automaton.

we prove that if $m$ is a monoid and $a$ a finite set with more than one element‎, ‎then the residual finiteness of $m$ is equivalent to that of the monoid consisting of all cellular automata over $m$ with alphabet $a$‎.

In this paper, we first define the notion of a complete general fuzzyautomaton with threshold c and construct an $H_{nu}$- group, as well as commutativehypergroups, on the set of states of a complete general fuzzy automatonwith threshold c. We then define invertible general fuzzy automata, discussthe notions of “homogeneity, “separation, “thresholdness connected, “thresholdnessinner irreducible...