Languages recognized by a class of finite automata

Kelarev Andrej V. and Sokratova Olga V.: Languages recognized by a class of finite automata. In: Acta cybernetica, (15) 1. pp. 45-52. (2001)

[thumbnail of cybernetica_015_numb_001_045-052.pdf]
Preview
Cikk, tanulmány, mű
cybernetica_015_numb_001_045-052.pdf

Download (665kB) | Preview

Abstract

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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2001
Volume: 15
Number: 1
ISSN: 0324-721X
Page Range: pp. 45-52
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38511/
Uncontrolled Keywords: Számítástechnika, Kibernetika, Algoritmus
Additional Information: Bibliogr.: 52. p. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 14. 12:50
URI: http://acta.bibl.u-szeged.hu/id/eprint/12661

Actions (login required)

View Item View Item