University of Tasmania
Browse

File(s) not publicly available

A class of semisimple automata

journal contribution
posted on 2023-05-16, 12:46 authored by Kelarev, AV, Sokratova, OV
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.

History

Publication title

Journal of Applied Mathematics and Computing

Volume

8

Pagination

1-8

ISSN

1598-5865

Department/School

School of Natural Sciences

Publisher

Korean Mathematical Society

Place of publication

Korea

Repository Status

  • Restricted

Socio-economic Objectives

Expanding knowledge in the mathematical sciences

Usage metrics

    University Of Tasmania

    Categories

    Keywords

    No keyword provided

    Licence

    In Copyright

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC