University of Tasmania
Browse

File(s) not publicly available

Languages Recognised by a Class of Finite Automata

journal contribution
posted on 2023-05-16, 12:46 authored by Kelarev, AV, Sokratova, OV
We consider automata defined by left multiplications in graph algebras, and describe all languages recognized by these automata in terms of combinatorial properties of words which belong to these languages, regular expressions and linear grammars defining these languages. This description is applied to investigate closure properties of the obtained family of languages.

History

Publication title

Acta Cybernetica

Volume

15

Pagination

45-52

ISSN

0324-721X

Department/School

School of Natural Sciences

Publisher

Attila-Jozsef-University

Place of publication

Hungary

Repository Status

  • Restricted

Socio-economic Objectives

Expanding knowledge in the mathematical sciences

Usage metrics

    University Of Tasmania

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC