A.V. Kelarev 2  - O.V. Sokratova 3

 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.  

 Footnotes

 1. The author has been supported by the Estonian Science Foundation, Grant 4912.

 2. Department of Mathematics, University of Tasmania, P.O.Box 252-37, Hobart, Tasmania~7001, Australia, e-mail: Andrei.Kelarev@utas.edu.au

 3. Institute of Computer Science, University of Tartu, Liivi 2, 50409 Tartu, Estonia, e-mail: olga@cs.ut.ee