On the Recognition Capacity of Abelian Graph Automata
DOI:
https://doi.org/10.29020/nybg.ejpam.v18i1.5850Keywords:
Graph Automata, Graph Theory, Pattern recognitionAbstract
This paper explores the recognition capacity of both unitary and non-unitary Abelian graph automata through the algebraic structure of graphoids. We investigate for the first time in the literature the recognition mechanism of non-unitary Abelian graph automata and prove that they can recognize graph languages which are beyond the recognition power of unitary graph automata. Consequently, we establish that the class of graph languages recognized by unitary automata is strictly contained within the class of those recognized by Abelian graph automata. These results manifest a proper hierarchy among graph automata classes and provide new insights into the recognition capabilities of graph automata.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Kyriakos Papadopoulos
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.