Structure and Behavior of Graph Automata Based on the Monopoly-Forcing Set
Marzieh Shamsizadeh, Khadijeh Abolpour · Journal of algebraic hyperstructures and logical algebras · 2024
In this note, we show that automata theory is a suitable tool for analyzing monopoly-forcing processes. Also, we present the notion of mono-forcing automata by using the monopoly-forcing set for graphs. Moreover, we prove that mono-forcing automata accept more languages than zero-forcing finite automata also, we show that all results in zero-forcing finite automata for complete graphs are established for mono-forcing automata. We examine and deliberate on the language associated with mono-forcing automata for certain specified graphs. Also, we present the style of words that can be recognized with mono-forcing automata. Additionally, we delineate the types of words identifiable by mono-forcing automata. We also describe the configuration of graphs from which mono-forcing automata emerge, generating specific languages. Several examples are provided to elucidate these concepts.