On congruences of automata defined by directed graphs

A.V Kelarev; O.V Sokratova

doi:10.1016/S0304-3975(02)00544-3

Back

On congruences of automata defined by directed graphs

Journal article

Open access

Peer reviewed

On congruences of automata defined by directed graphs

A.V Kelarev and O.V Sokratova

Theoretical computer science, Vol.301(1-3), pp.31-43

05/14/2003

DOI: 10.1016/S0304-3975(02)00544-3

Files and links (1)

url

https://doi.org/10.1016/S0304-3975(02)00544-3View

Published (Version of record) Open Access

Abstract

We consider automata defined by graph algebras of directed graphs, characterize all congruences on these automata, and give a complete description of all automata of this type satisfying three properties for congruences introduced and considered in the literature by analogy with classical semisimplicity conditions that play important roles in structure theory.

Automata

Congruences

Directed graphs

Details

Title: Subtitle: On congruences of automata defined by directed graphs
Creators: A.V Kelarev - University of Tasmania
O.V Sokratova - University of Tartu
Resource Type: Journal article
Publication Details: Theoretical computer science, Vol.301(1-3), pp.31-43
DOI: 10.1016/S0304-3975(02)00544-3
ISSN: 0304-3975
eISSN: 1879-2294
Publisher: Elsevier B.V
Language: English
Date published: 05/14/2003
Academic Unit: Mathematics
Record Identifier: 9984241149302771

Metrics

9 Record Views

12 Times Cited - Web of Science