id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-5850	Papadopoulos, Kyriakos 	On the Recognition Capacity of Abelian Graph Automata	2025	13	.pdf	application/pdf	5281	302	71	Regarding the recognition ability of unitary graph automata, i.e., graph automata employing unitary graphoids, we know that they recognize for every positive integer k, the set of all directed k-colorable graphs with- out inputs and outputs [20]. Math, 18 (1) (2025), 5850 7 of 13 Figure 1: The class hierarchy of graph automata graph languages recognized by abelian graph automata and by Urec(Σ) the set of graph languages recognized by unitary graph automata.	cache/ejpam-5850.pdf	txt/ejpam-5850.txt