On congruences of automata defined by directed graphs

DOI10.1016/S0304-3975(02)00544-3zbMath1022.68068OpenAlexW2141373037MaRDI QIDQ1399978

Andrei V. Kelarev, O. V. Sokratova

Publication date: 30 July 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00544-3

zbMATH Keywords

automatacongruencesdirected graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items (8)

ON THE STRUCTURE OF INCIDENCE RINGS OF GROUP AUTOMATA ⋮ On group automata over finite fields. ⋮ Optimization of classifiers for data mining based on combinatorial semigroups ⋮ Graph variety generated by linear terms ⋮ INTERNET SECURITY APPLICATIONS OF GRÖBNER-SHIRSHOV BASES ⋮ Internet security applications of the Munn rings ⋮ Cayley graphs as classifiers for data mining: the influence of asymmetries ⋮ Ideal basis in constructions defined by directed graphs

Cites Work

• Graph algebras and graph varieties
• The Equational Logic For Graph Algebras
• Handbook of Graph Grammars and Computing by Graph Transformation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On congruences of automata defined by directed graphs