eCite Digital Repository

A class of semisimple automata

Citation

Kelarev, AV and Sokratova, OV, A class of semisimple automata, Journal of Applied Mathematics and Computing, 8, (1) pp. 1-8. ISSN 1598-5865 (2001) [Refereed Article]

DOI: doi:10.1007/BF03011618

Abstract

We show that all automata in a certain natural class satisfy three semisimplicity properties and describe all languages recognized by these automata. © 2001 Korean Society for Computational & Applied Mathematics and Korean SIGCAM.

Item Details

Item Type:Refereed Article
Research Division:Information and Computing Sciences
Research Group:Computation Theory and Mathematics
Research Field:Computation Theory and Mathematics not elsewhere classified
Objective Division:Expanding Knowledge
Objective Group:Expanding Knowledge
Objective Field:Expanding Knowledge in the Mathematical Sciences
Author:Kelarev, AV (Dr Andrei Kelarev)
Author:Sokratova, OV (Ms Olga Sokratova)
ID Code:21386
Year Published:2001
Deposited By:Mathematics
Deposited On:2001-08-01
Last Modified:2011-11-18
Downloads:0

Repository Staff Only: item control page