Two Algorithms For Languages Recognized By Graph Algebras

DOI10.1080/00207160214649MaRDI QIDQ4792965zbMATH OpenOpenAlexFDO

Authors A. 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

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

Recommendations

• Languages recognized by a class of finite automata
• Algebras of languages associated with labelled graphs
• scientific article; zbMATH DE number 1740163
• Languages which can be represented by completely labelled graphs
• Algebra of languages representable in vertex-labelled graphs

Cites work

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

Cited in

(10)

• scientific article; zbMATH DE number 2111186 (Why is no real title available?)
• Path Algorithms on Regular Graphs
• Recognizability of graph and pattern languages
• scientific article; zbMATH DE number 1740163 (Why is no real title available?)
• Properties of graphs specified by a regular language
• Languages recognized by a class of finite automata
• Cayley graphs as classifiers for data mining: the influence of asymmetries
• Algebras of languages associated with labelled graphs
• Regular languages viewed from a graph-theoretic perspective
• Efficient recognition algorithms for boundary and linear eNCE graph languages

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4792965)