A class of semisimple automata

Journal article

Peer reviewed

A Kelarev and O Sokratova

Journal of applied mathematics & computing, Vol.8(1), pp.1-8

01/2001

DOI: 10.1007/BF03011618

View Online

We show that all automata in a certain natural class satisfy three semisimplicity properties and describe all languages recognized by these automata.

08A70

20M35

68Q70

Appl.Mathematics/Computational Methods of Engineering

Computational Mathematics and Numerical Analysis

congruences on automata

Finite state automata

Mathematics

Mathematics of Computing

semisimple automata

Theory of Computation

Title: Subtitle: A class of semisimple automata
Creators: A Kelarev - University of Tasmania
O Sokratova - University of Tartu
Resource Type: Journal article
Publication Details: Journal of applied mathematics & computing, Vol.8(1), pp.1-8
Publisher: Springer-Verlag
DOI: 10.1007/BF03011618
ISSN: 1226-0061
eISSN: 1865-2085
Language: English
Date published: 01/2001
Academic Unit: Mathematics
Record Identifier: 9984240766702771

13 Record Views