Graph algebra: Difference between revisions

Revision as of 03:18, 29 January 2023

Revision as of 12:35, 5 October 2023

Line 10:

== Applications ==

This notion has made it possible to use the methods of graph theory in universal algebra and several other directionsareas of [[discrete mathematics]] and [[computer science]]. Graph algebras have been used, for example, in constructions concerning [[Dual (category theory)|dualities]],{{sfn|Davey|Idziak|Lampe|McNulty|2000|pp=145–172}} [[equational theory|equational theories]],{{sfn|Pöschel|1989|pp=273–282}} [[flatness (systems theory)|flatness]],{{sfn|Delić|2001|pp=453–469}} [[groupoid (algebra)|groupoid]] [[ring (mathematics)|rings]],{{sfn|Lee|1991|pp=117–121}} [[topology|topologies]],{{sfn|Lee|1988|pp=147–156}} [[variety (universal algebra)|varieties]],{{sfn|Oates-Williams|1984|pp=175–177}} [[finite -state automatamachine]]s,{{sfn|Kelarev|Miller|Sokratova|2005|pp=46–54}} [[finite-state machine]]s,{{sfn|Kelarev|Sokratova|2003|pp=31–43}}

tree languages and [[tree automata]],{{sfn|Kelarev|Sokratova|2001|pp=305–311}} etc.

Line 34:

*{{Cite journal | title = Finite bases for flat graph algebras

| last = Delić | first = Dejan

| journal = [[Journal of Algebra]]

| year = 2001 | volume = 246 | issue = 1 | pages = 453–469

| doi = 10.1006/jabr.2001.8947 | issn = 0021-8693 | mr = 1872631

Line 91:

| last = Oates-Williams | first = Sheila

| author-link = Sheila Oates Williams

| journal = [[Algebra Universalis]]

| year = 1984 | volume = 18 | issue = 2 | pages = 175–177

| doi = 10.1007/BF01198526 | issn = 0002-5240 | mr = 743465 | s2cid = 121598599