相关论文: On Krohn-Rhodes theory for semiautomata

The paper is devoted to two types of algebraic models of automata. The usual (first type) model leads to the developed decomposition theory (Krohn-Rhodes theory). We introduce another type of automata model and study how these automata are…

The Krohn-Rhodes complexity theory for pure (without linearity) automata is well-known. This theory uses an operation of wreath product as a decomposition tool. The main goal of the paper is to introduce the notion of complexity of linear…

When decomposing a finite semigroup into a wreath product of groups and aperiodic semigroups, complexity measures the minimal number of groups that are needed. Determining an algorithm to compute complexity has been an open problem for…

The Krohn-Rhodes Theorem proves that a finite semigroup divides a wreath product of groups and aperiodic semigroups. Krohn-Rhodes complexity equals the minimal number of groups that are needed. Determining an algorithm to compute complexity…

A definition of a probabilistic automaton is formulated in which its prime decomposition follows as a direct consequence of Krohn-Rhodes theorem. We first characterize the local structure of probabilistic automata. The prime decomposition…

Every automaton can be decomposed into a cascade of basic prime automata. This is the Prime Decomposition Theorem by Krohn and Rhodes. Guided by this theory, we propose automata cascades as a structured, modular, way to describe automata as…

The question of computing the group complexity of finite semigroups and automata was first posed in K. Krohn and J. Rhodes, \textit{Complexity of finite semigroups}, Annals of Mathematics (2) \textbf{88} (1968), 128--160, motivated by the…

Programming languages tend to evolve over time to use more and more concepts from theoretical computer science. Still, there is a gap between programming and pure mathematics. Not all theoretical results have realized their promising…

Methods for specifying Moore type state machines (transducers) abstractly via primitive recursive functions and for defining parallel composition via simultaneous primitive recursion are discussed. The method is mostly of interest as a…

This paper provides short proofs of two fundamental theorems of finite semigroup theory whose previous proofs were significantly longer, namely the two-sided Krohn-Rhodes decomposition theorem and Henckell's aperiodic pointlike theorem,…

This document gives a list of finite semigroups that are interesting from the point of view of Krohn-Rhodes complexity theory. The list will be expanded and updates as "time goes by".

Semi-automata are abstractions of electronic devices that are deterministic finite-state machines having inputs but no outputs. Generalized semiautomata are obtained from stochastic semiautomata by dropping the restrictions imposed by…

Abstracting an effective theory from a complicated process is central to the study of complexity. Even when the underlying mechanisms are understood, or at least measurable, the presence of dissipation and irreversibility in biological,…

In recent papers, Margolis, Rhodes and Schilling proved that the complexity of a finite semigroup is computable. This solved a problem that had been open for more than 50 years. The purpose of this paper is to survey the basic results of…

While automata theory often concerns itself with regular predicates, relations corresponding to acceptance by a finite state automaton, in this article we study the regular functions, such relations which are also functions in the…

We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…

We develop the theory of transformation semigroups that have degree 2, that is, act by partial functions on a finite set such that the inverse image of points have at most two elements. We show that the graph of fibers of such an action…

In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…

This paper contains results related to synthesis and presentation of abstract automata by fragments of behaviour and investigates the structure of the classes of finite connected initial output-less automata specified by systems of defining…

We introduce a new geometric tool for analyzing groups of finite automata. To each finite automaton we associate a square complex. The square complex is covered by a product of two trees iff the automaton is bi-reversible. Using this method…