Cartesian Product of Automata

Dutta, Mridul; Kalita, Sanjoy; Saikia, Helen K.

doi:10.37418/amsj.9.10.25

Cited by 3 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Currently, the combinations of algebraic multiautomata into higher entities, using various rules suggested by Dörfler [20,26], are studied-see, e.g., [27]. Such combinations seem to be suitable tools for modeling various real-life systems-see, e.g., [16,21,28]-or are even tools to control such systems [22].…”

Section: Discussionmentioning

confidence: 99%

From Automata to Multiautomata via Theory of Hypercompositional Structures

2021

View full text Add to dashboard Cite

In this paper, we study two important problems related to quasi-multiautomata: the complicated nature of verification of the GMAC condition for systems of quasi-multiautomata, and the fact that the nature of quasi-multiautomata has deviated from the original nature of automata as seen by the theory of formal languages. For the former problem, we include several new conditions that simplify the procedure. For the latter problem, we close this gap by presenting a construction of quasi-multiautomata, which corresponds to deterministic automata of the theory of formal languages and is based on the operation of concatenation.

show abstract

Section: Discussionmentioning

confidence: 99%

From Automata to Multiautomata via Theory of Hypercompositional Structures

2021

View full text Add to dashboard Cite

show abstract

Cellular automaton created as an m-ary product of algebraic quasi-multiautomata

Křehlík

2022

Soft Comput

View full text Add to dashboard Cite

In 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.

show abstract

A Novel Approach to Construct Finite Automata Using Grid and Product Automata

Rupam Nag,

Dibyendu Barman,

Abul Hasnat

2024

Adv. technol. innov.

View full text Add to dashboard Cite

This research aims to utilize an organized grid-based strategy to make the development of complex Finite Automata easier. Product Automata are used to merge many automata into a single automaton to integrate various computing processes. Combining these methodologies provides novel methods of improving the scalability and efficiency of automata building, broadening the field of research for automata theory and its applications. The scalability of this developed automated system will benefit sectors such as automotive production and logistics. The results indicate considerable improvements in construction time, memory usage, scalability, and resilience compared to older approaches. The performance of the developed method, as measured by construction time, memory utilization, scalability, robustness, application range, and complexity, is 25% to 50% higher than that of traditional methodologies in the literature.

show abstract

Cartesian Product of Automata

Cited by 3 publications

References 0 publications

From Automata to Multiautomata via Theory of Hypercompositional Structures

From Automata to Multiautomata via Theory of Hypercompositional Structures

Cellular automaton created as an m-ary product of algebraic quasi-multiautomata

A Novel Approach to Construct Finite Automata Using Grid and Product Automata

Contact Info

Product

Resources

About