eCite Digital Repository
Languages Recognised by a Class of Finite Automata
Citation
Kelarev, AV and Sokratova, OV, Languages Recognised by a Class of Finite Automata, Acta Cybernetica, 15, (1) pp. 45-52. ISSN 0324-721X (2001) [Refereed Article]
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 Details
| Item Type: | Refereed Article |
|---|---|
| Research Division: | Information and Computing Sciences |
| Research Group: | Theory of computation |
| Research Field: | Computational logic and formal languages |
| Objective Division: | Expanding Knowledge |
| Objective Group: | Expanding knowledge |
| Objective Field: | Expanding knowledge in the mathematical sciences |
| UTAS Author: | Kelarev, AV (Dr Andrei Kelarev) |
| UTAS Author: | Sokratova, OV (Ms Olga Sokratova) |
| ID Code: | 21374 |
| Year Published: | 2001 |
| Deposited By: | Mathematics |
| Deposited On: | 2001-08-01 |
| Last Modified: | 2011-08-02 |
| Downloads: | 0 |
Repository Staff Only: item control page