Languages recognized by a class of finite automata

Acta Cybernetica

Volumn 15, Issue 1, 2001, Pages 45-52

  Kelarev, A V ^a   Sokratova, O V ^b  

^a UNIVERSITY OF TASMANIA   (Australia)

^b UNIVERSITY OF TARTU   (Estonia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034893051     PISSN: 0324721X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. J. Berstel, Finite automata and rational languages: an introduction, in "Formal Properties of Finite Automata and Applications", Lect. Notes Comp. Sci. 386, Springer, New York, 1989, 2-14.
2. E. W. KISS, R. PÖSCHEL, P. PRÖHLE, Subvarieties of varieties generated by graph algebras, Acta Sci. Math. 54 (1990), 57-75.
3. G. Lallement, "Semigroups and Combinatorial Applications", Wiley, New York, 1979.
4. G.F. McNulty, C. Shallon, Inherently nonfinitely based finite algebras, Lect. Notes Math. 1004 (1983), 206-231.
5. S. Oates-Williams, Graphs and universal algebra, Lect. Notes Math. 884 (1981), 351-354.
6. S. Oates-Williams, On the variety generated by Murski's algebra, Algebra Universalis 18 (1984), 175-177.
7. G. Paun, A. Salomaa, "New Trends in Formal Languages", Lect. Notes Comp. Sci. 1218, Springer-Verlag, Berlin, 1997.
8. R. Pöschel, The equational logic for graph algebras, Z. Math. Logik Grundlag Math. 35 (1989), no. 3, 273-282.
9. R. Pöschel, Graph algebras and graph varieties, Algebra Universalis 27 (1990), no. 4, 559-577.
10. R. Pöschel, W. Wessel, Classes of graphs definable by graph algebra identities or quasi-identities, Comment. Math. Univ. Carolinae 28 (1987), no. 3, 581-592.
11. G. Rozenberg, A. Salomaa (Eds.), "Handbook of Formal Languages", Vol. 1, 2, 3, Springer, New York, 1997.