On congruences of automata defined by directed graphs

Authors:
A. V. Kelarev;O. V. Sokratova
Affiliations:
Faculty of Science and Engineering, University of Tasmania, GPO Box 252-37, Hobart, Tasmania 7001, Australia;Institute of Computer Science, Tartu University, J.Liivi 2, 50409 Tartu, Estonia
Venue:
Theoretical Computer Science
Year:
2003

Citing 5
Cited 2

Finite automata and rational languages. An introduction

Proceedings of the LITP Spring School on Theoretical Computer Science on Formal properties of finite automata and applications
Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools

Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools
Semigroups and Combinatorial Applications

Semigroups and Combinatorial Applications
Handbook of Formal Languages

Handbook of Formal Languages
Languages recognized by a class of finite automata

Acta Cybernetica

A new model for classifying DNA code inspired by neural networks and FSA

PKAW'06 Proceedings of the 9th Pacific Rim Knowledge Acquisition international conference on Advances in Knowledge Acquisition and Management
On group automata over finite fields

Finite Fields and Their Applications

Quantified Score

Hi-index	5.23

Visualization

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.