eCite Digital Repository

Two algorithms for languages recognized by graph algebras

Citation

Kelarev, AV and Sokratova, OV, Two algorithms for languages recognized by graph algebras, International Journal of Computer Mathematics, 79, (12) pp. 1317-1327. ISSN 0020-7160 (2002) [Refereed Article]

DOI: doi:10.1080/0020716021000049765

Abstract

In this paper we give an algorithmic description of all regular languages recognized by graph algebras of directed graphs. A description of the analogous class of regular languages for the case of undirected graphs is obtained as a corollary.

Item Details

Item Type:Refereed Article
Research Division:Information and Computing Sciences
Research Group:Computation Theory and Mathematics
Research Field:Computational Logic and Formal Languages
Objective Division:Expanding Knowledge
Objective Group:Expanding Knowledge
Objective Field:Expanding Knowledge in the Mathematical Sciences
Author:Kelarev, AV (Dr Andrei Kelarev)
ID Code:24268
Year Published:2002
Web of Science® Times Cited:2
Deposited By:Mathematics
Deposited On:2002-08-01
Last Modified:2003-05-07
Downloads:0

Repository Staff Only: item control page