Content deleted Content added
Graphalgebra (talk | contribs) added link tree automata |
Graphalgebra (talk | contribs) m missing space |
||
Line 8:
This notion has made it possible to use the methods of [[graph theory]] in [[universal algebra]] and several other directions of [[discrete mathematics]] and [[computer science]]. Graph algebras have been used, for example, in constructions concerning dualities {{harv|Davey|Idziak|Lampe|McNulty|2000}}, [[equational theory|equational theories]] {{harv|Pöschel|1989}}, flatness {{harv|Delić|2001}}, [[groupoid (algebra)|groupoid]] [[ring (mathematics)|ring]]s {{harv|Lee|1991}}, [[topology|topologies]] {{harv|Lee|1988}}, [[variety (universal algebra)|varieties]] {{harv|Oates-Williams|1984}}, [[finite state automata]] {{harv|Kelarev|Miller|Sokratova|2005}}, [[finite state machine]]s {{harv|Kelarev & Sokratova|2003}},
tree languages and [[tree automata]] {{harv|Kelarev|Sokratova|2001}} etc.
== See also ==
| |||