An axiomatization of graphs

Authors:
Symeon Bozapalidis;Antonios Kalampakas
Affiliations:
Aristotle University of Thessaloniki, Department of Mathematics, 54006, Thessaloniki, Greece;Aristotle University of Thessaloniki, Department of Mathematics, 54006, Thessaloniki, Greece
Venue:
Acta Informatica
Year:
2004

Citing 0
Cited 4

Graph automata

Theoretical Computer Science
The syntactic complexity of Eulerian graphs

CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Graph automata: the algebraic properties of abelian relational graphoids

Algebraic Foundations in Computer Science
Towards probabilistic acceptors and transducers for feature structures

SSST-6 '12 Proceedings of the Sixth Workshop on Syntax, Semantics and Structure in Statistical Translation

Quantified Score

Hi-index	0.01

Visualization

Abstract

The magmoid of hypergraphs labelled over a finite doubly ranked alphabet, is characterized as the quotient of the free magmoid generated by this alphabet divided by a finite set of equations. Thus a relevant open problem, posed by Engelfriet and Vereijken, is being solved.