Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-23T02:25:58.048Z Has data issue: false hasContentIssue false
  • English
  • Français

Syntactic semigroups and graph algebras

Published online by Cambridge University Press:  17 April 2009

A. V. Kelarev  and
O. V. Sokratova
A. V. Kelarev
Affiliation:
Department of Mathematics, University of Tasmania, G.P.O. Box 252–37, Hobart, Tasmania 7001, Australia e-mail: [email protected]
O. V. Sokratova
Affiliation:
Department of Mathematics, Tartu University, J. Liivi 2, 50409 Tartu, Estonia e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We describe all directed graphs with graph algebras isomorphic to syntactic semigroups of languages.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 62 , Issue 3 , December 2000 , pp. 471 - 477
Copyright
Copyright © Australian Mathematical Society 2000

References

[1]Eilenberg, S., Automata, languages and machines, Vol. A, B (Academic Press, New York, 1976).Google Scholar
[2]Kiss, E.W., Pöschel, R. and Pröhle, P., ‘Subvarieties of varieties generated by graph algebras’, Acta Sci. Math. 54 (1990), 57–75.Google Scholar
[3]Lallement, G., Semigroups and combinatorial applications (J. Wiley, New York, 1979).Google Scholar
[4]McNulty, G.F. and Shallon, C., ‘Inherently nonfinitely based finite algebras’, in Universal algebra and lattice theory (Puebla, 1982), Lecture Notes Math. 1004, 1983, pp. 206–231.CrossRefGoogle Scholar
[5]Oates-Williams, S., ‘Murski's algebra does not satisfy min’, Bull Austral. Math. 22 (1980), 199–203.CrossRefGoogle Scholar
[6]Oates-Wiliams, S., ‘Graphs and universal algebra’, in Combinatorial Mathematics III (Geelong 1980), Lecture Notes Math. 884 (Springer-Verlag, Berlin, Heidelberg, New York, 1981), pp. 351–354.Google Scholar
[7]Oates-Williams, S., ‘On the variety generated by Murski's algebra’, Algebra Universalis 18 (1984), 175–177.CrossRefGoogle Scholar
[8]Pöschel, R. ‘The equational logic for graph algebras’, Z. Math. Logik Grundlag Math. 35 (1989), 273–282.CrossRefGoogle Scholar
[9]Pöschel, R. and Wessel, W., ‘Classes of graphs definable by graph algebra identities or quasi-identities’, Comment. Math. Univ. Carolin. 28 (1987), 581–592.Google Scholar
[10]Rozenberg, G., Salomaa, A. (Eds.), Handbook of formal languages, Vol. 1, 2, 3, (Springer-Verlag, Berlin, Heidelberg, New York, 1997).Google Scholar