Languages recognized by a class of finite automata
AbstractWe 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.
Download data is not yet available.
How to Cite
Kelarev, A. V., & Sokratova, O. V. (2001). Languages recognized by a class of finite automata. Acta Cybernetica, 15(1), 45-52. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3562