Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 79, 2002 - Issue 12
Submit an article Journal homepage
33
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

Two Algorithms For Languages Recognized By Graph Algebras

A. V. Kelarev Department of Mathematics, University of Tasmania, GPO Box 252-37, Hobart, Tasmania, 7001, Australia
&
O. V. Sokratova Institute of Computer Science, University of Tartu, J. Liivi 2, Tartu, 50409, Estonia
Pages 1317-1327 | Published online: 15 Sep 2010
 
Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days

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.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.