Click here for immediate access to the latest key research articles

TWO ALGORITHMS FOR LANGUAGES RECOGNIZED BY GRAPH ALGEBRAS

Authors: A. V. Kelarev ^a; O. V. Sokratova ^b

Affiliations:	^a Department of Mathematics, University of Tasmania, GPO Box 252-37 Hobart, Tasmania 7001, Australia.
	^b Institute of Computer Science, University of Tartu, J. Liivi 2, 50409 Tartu, Estonia.

DOI: 10.1080/00207160214649

Publication Frequency: 15 issues per year

Published in: journal

International Journal of Computer Mathematics, Volume 79, Issue 12 2002 , pages 1317 - 1327

Subjects: Analysis - Mathematics; Bioinformatics; Computer Mathematics; Discrete Mathematics; Mathematical Finance; Mathematical Logic; Mathematical Numerical Analysis; Systems & Computer Architecture;

Number of References: 23

Formats available: PDF (English)

Article Requests: Order Reprints : Request Permissions

Single Article Purchase: US$37.00 - buy now buy now

add to cart

[ show other buying options ]

purchase type	customer type	online access	payment method	price
Single Article Purchase	Any	3 days, 1 user, 3 cookies	credit card	US$37.00	buy now add to cart
Issue Purchase	Any	permanent	credit card	US$607.02	buy now add to cart

If you would like to pay in any other currency please see the purchasing help pages for more information.

If you are an agent wanting to subscribe on behalf of your customer please contact our subscriptions department on the following email address: subscriptions@tandf.co.uk

Sign In
Online Sample

View Article:

View Article (PDF)

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.

Keywords: Automata; Languages; Directed Graphs

view references (23)

Bookmark with:

More bookmarks

informaworld

About this Journal

General Information

TWO ALGORITHMS FOR LANGUAGES RECOGNIZED BY GRAPH ALGEBRAS

Abstract