Structure and behavior of graph automata based on the monopoly-forcing set

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Shamsizadeh M.; Abolpour K.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ALGEBRAIC HYPERSTRUCTURES AND LOGICAL ALGEBRAS Year:2024 | Volume:5 | Issue:2 Page(s): 123-135

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Structure and behavior of graph automata based on the monopoly-forcing set

Author(s)

Shamsizadeh M. | Abolpour K. | Issue Writer Certificate

Keywords

Graph

Automata

mono-forcing

zero-forcing set

mono-forcing automata

Abstract

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.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans