1
|
Křehlík Š. Cellular automaton created as an m-ary product of algebraic quasi-multiautomata. Soft comput 2022. [DOI: 10.1007/s00500-022-07747-9] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/24/2022]
Abstract
AbstractIn this work, we follow the construction of an n-ary system of Cartesian composition of multiautomata with internal links, where we define the internal links to the homogeneous and heterogeneous products of multi-automata. While the introduction of an internal link is rectilinear in the Cartesian composition, it requires a new approach in product construction for the other two automata products. In this way, it is possible to focus on multiple options for creating these systems. More specifically, we combine automata and multi-automata with binding according to the basic definitions given by Dörfler. This approach shows new connections to cellular automata, which allow for the modeling of phenomena in many areas. At the end of the work, we discuss the advantages of these individual schemes for quasi-multiautomata connections.
Collapse
|
2
|
State Machines and Hypergroups. MATHEMATICS 2022. [DOI: 10.3390/math10142427] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 02/04/2023]
Abstract
State machines are a type of mathematical modeling tool that is commonly used to investigate how a system interacts with its surroundings. The system is thought to be made up of discrete states that change in response to external inputs. The state machines whose environment is a two-element magma are investigated in this study, focusing on the case when the magma is a group or a hypergroup. It is shown that state machines in any two-element magma can only have up to three states. In particular, the quasi-automata and quasi-multiautomata state machines are described and enumerated.
Collapse
|
3
|
Abstract
This paper is written in the framework of the Special Issue of Mathematics entitled “Hypercompositional Algebra and Applications”, and focuses on the presentation of the essential principles of the hypergroup, which is the prominent structure of hypercompositional algebra. In the beginning, it reveals the structural relation between two fundamental entities of abstract algebra, the group and the hypergroup. Next, it presents the several types of hypergroups, which derive from the enrichment of the hypergroup with additional axioms besides the ones it was initially equipped with, along with their fundamental properties. Furthermore, it analyzes and studies the various subhypergroups that can be defined in hypergroups in combination with their ability to decompose the hypergroups into cosets. The exploration of this far-reaching concept highlights the particularity of the hypergroup theory versus the abstract group theory, and demonstrates the different techniques and special tools that must be developed in order to achieve results on hypercompositional algebra.
Collapse
|
4
|
Sequences of Groups, Hypergroups and Automata of Linear Ordinary Differential Operators. MATHEMATICS 2021. [DOI: 10.3390/math9040319] [Citation(s) in RCA: 4] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
Abstract
The main objective of our paper is to focus on the study of sequences (finite or countable) of groups and hypergroups of linear differential operators of decreasing orders. By using a suitable ordering or preordering of groups linear differential operators we construct hypercompositional structures of linear differential operators. Moreover, we construct actions of groups of differential operators on rings of polynomials of one real variable including diagrams of actions–considered as special automata. Finally, we obtain sequences of hypergroups and automata. The examples, we choose to explain our theoretical results with, fall within the theory of artificial neurons and infinite cyclic groups.
Collapse
|
5
|
Abstract
The various branches of Mathematics are not separated between themselves. On the contrary, they interact and extend into each other’s sometimes seemingly different and unrelated areas and help them advance. In this sense, the Hypercompositional Algebra’s path has crossed, among others, with the paths of the theory of Formal Languages, Automata and Geometry. This paper presents the course of development from the hypergroup, as it was initially defined in 1934 by F. Marty to the hypergroups which are endowed with more axioms and allow the proof of Theorems and Propositions that generalize Kleen’s Theorem, determine the order and the grade of the states of an automaton, minimize it and describe its operation. The same hypergroups lie underneath Geometry and they produce results which give as Corollaries well known named Theorems in Geometry, like Helly’s Theorem, Kakutani’s Lemma, Stone’s Theorem, Radon’s Theorem, Caratheodory’s Theorem and Steinitz’s Theorem. This paper also highlights the close relationship between the hyperfields and the hypermodules to geometries, like projective geometries and spherical geometries.
Collapse
|
6
|
n-Ary Cartesian Composition of Multiautomata with Internal Link for Autonomous Control of Lane Shifting. MATHEMATICS 2020. [DOI: 10.3390/math8050835] [Citation(s) in RCA: 4] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/17/2022]
Abstract
In this paper, which is based on a real-life motivation, we present an algebraic theory of automata and multi-automata. We combine these (multi-)automata using the products introduced by W. Dörfler, where we work with the cartesian composition and we define the internal links among multiautomata by means of the internal links’ matrix. We used the obtained product of n-ary multi-automata as a system that models and controls certain traffic situations (lane shifting) for autonomous vehicles.
Collapse
|
7
|
The Symmetry of Lower and Upper Approximations, Determined by a Cyclic Hypergroup, Applicable in Control Theory. Symmetry (Basel) 2019. [DOI: 10.3390/sym12010054] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/16/2022] Open
Abstract
In the first part of our paper, we construct a cyclic hypergroup of matrices using the Ends Lemma. Its properties are then, in the second part of the paper, used to describe the symmetry of lower and upper approximations in certain rough sets with respect to invertible subhypergroups of this cyclic hypergroup. Since our approach is widely used in autonomous robotic systems, we suggest an application of our results for the study of detection sensors, which are used especially in mobile robot mapping.
Collapse
|
8
|
Abstract
In our paper we discuss how elements of algebraic hyperstructure theory can be used in the context of underwater wireless sensor networks (UWSN). We present a mathematical model which makes use of the fact that when deploying nodes or operating the network we, from the mathematical point of view, regard an operation (or a hyperoperation) and a binary relation. In this part of the paper we relate our context to already existing topics of the algebraic hyperstructure theory such as quasi-order hypergroups, E L -hyperstructures, or ordered hyperstructures. Furthermore, we make use of the theory of quasi-automata (or rather, semiautomata) to relate the process of UWSN data aggregation to the existing algebraic theory of quasi-automata and their hyperstructure generalization. We show that the process of data aggregation can be seen as an automaton, or rather its hyperstructure generalization, with states representing stages of the data aggregation process of cluster protocols and describing available/used memory capacity of the network.
Collapse
|