Related papers: Automaton (Semi)groups (Basic Concepts)
Some very elementary ideas about quantum groups and quantum algebras are introduced and a few examples of their physical applications are mentioned.
We develop a general, functional calculus approach to approximation of $C_0$-semigroups on Banach spaces by bounded completely monotone functions of their generators. The approach comprises most of well-known approximation formulas, yields…
In this preliminary note, we will illustrate our ideas on automated mechanisms for termination and non-termination reasoning.
In this paper we introduce the concept of corner element of a generalized numerical semigroup, which extends in a sense the idea of conductor of a numerical semigroup to generalized numerical semigroups in higher dimensions. We present…
We introduce a novel framework for simulating finite automata using representation-theoretic semidirect products and Fourier modules, achieving more efficient Transformer-based implementations.
In this paper, we introduce the concept of Arf special gaps of an Arf numerical semigroup, and an algorithm for computing all Arf special gaps of a given Arf numerical semigroup. We introduce the concept of Arf-irreducible numerical…
In this paper we investigate right uniform notion on some classes of semigroups. The main objective of this paper is realizing the structure of regular right uniform semigroups which can be applied as a cornerstone of characterizing regular…
In this paper, the definitions of soft {\Gamma}-semirings and soft sub {\Gamma}-semi rings are introduced with the aid of the concept of soft set theory introduced by Molodtsov. In the mean time, some of their properties and structural…
The paper introduces the concept of asynchronous pseudo-system. Its purpose is to correct/generalize/continue the study of the asynchronous systems (the models of the asynchronous circuits) that has been started in [1], [2].
The purpose of this paper is to investigate some properties of fuzzy ideals and fuzzy bi-ideals in gamma-semigroups and to introduce the notion of fuzzy quasi ideals in gamma-semigroups. Here we also characterize a regular gamma-semigroup…
The purpose of this note is to introduce primitive ideals of noncommutative semigroups and study some topological aspects of the corresponding structure spaces.
In this paper, the author aims to establish a mathematical model for a mimic computer. To this end, a novel automaton is proposed. First, a one-dimensional cellular automaton is used for expressing some dynamic changes in the structure of a…
Krohn-Rhodes theory encompasses the techniques for the study of finite automata and their decomposition into elementary automata. The famous result of Krohn and Rhodes roughly states that each finite automaton can be decomposed into…
In this paper we give an algebraic characterization of assemblies in terms of bands of groups. We also consider substructures and homomorphisms of assemblies. We give many examples and counterexamples.
This paper has several purposes. We present through a critical review the results from already published papers on the constructive semigroup theory, and contribute to its further development by giving solutions to open problems. We also…
In the paper, we deal with the notion of an automaton over a changing alphabet, which generalizes the concept of a Mealy-type automaton. We modify the methods based on the idea of a dual automaton and its action used by B. Steinberg et al.…
Necessary and sufficient conditions for finite semihypergroups to be built from groups of the same order are established
The structure of categorical at zero semigroups is studied from the point of view their likeness to categories.
Two new classes of finite automata, called General hexagonal Boustrophedon finite automata and General hexagonal returning finite automata operating on hexagonal grids, are introduced and analyzed. The work establishes the theoretical…
In this work we use a framework of finite-state automata constructions based on equivalences over words to provide new insights on the relation between well-known methods for computing the minimal deterministic automaton of a language.