Two Algorithms For Languages Recognized By Graph Algebras

DOI10.1080/00207160214649zbMath1008.68071OpenAlexW2085032386MaRDI QIDQ4792965

Andrei V. Kelarev, O. V. Sokratova

Publication date: 17 February 2003

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160214649

zbMATH Keywords

regular languages

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Formal languages and automata (68Q45)

Related Items (1)

Cayley graphs as classifiers for data mining: the influence of asymmetries

Cites Work

• From regular expressions to deterministic automata
• Regular expressions into finite automata
• From regular expressions to DFA's using compressed NFA's
• Dualizability and graph algebras
• The Equational Logic For Graph Algebras
• Syntactic semigroups and graph algebras

This page was built for publication: Two Algorithms For Languages Recognized By Graph Algebras