Two algorithms for languages recognized by graph algebras

International Journal of Computer Mathematics

Volumn 79, Issue 12, 2002, Pages 1317-1327

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

^a UNIVERSITY OF TASMANIA   (Australia)

^b UNIVERSITY OF TARTU   (Estonia)

Author keywords

Automata; Directed graphs; Languages

Indexed keywords

ALGEBRA; ALGORITHMS; GRAPH THEORY;

AUTOMATA; DIRECTED GRAPH;

FORMAL LANGUAGES;

EID: 28344444430     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160214649     Document Type: Article

References (23)

1. Aho, A. V., Hopcroft, J. and Ullman, J. D. (1974) The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading).
2. Aho, A. V., Sethi, R. and Ullman, J. D. (1986) Compilers - Principles, Techniques, and Tools (Addison-Wesley, Reading).
3. Arbib, M. A. (1968) Algebraic Theory of Machines, Languages, and Semigroups (Academic Press, New York).
4. Berstel, J. (1989) Finite automata and rational languages; an introduction. In Formal Properties of Finite Automata and Applications, Lect. Notes Computer Science 386 (Springer, New York).
5. Chang, C. H. and Paige, R. (1992) From regular expressions to DFA's using compressed NFA's, Proc. Third Symposium on Combinatorial Pattern Matching, 90-110.
6. Berry, G. and Sethi, R. (1986) From regular expressions to deterministic automata, Theoret. Comp. Sci. 48, 117-126.
7. Brüggeman-Klein, A. (1993) Regular expressions into finite automata, Theoret. Comp. Sci. 120, 197-213.
8. Davey, B. A., Idziak, P. M., Lampe, W. A. and McNulty, G. F. (2000) Dualizability and graph algebras, Discrete Math. 214(1-3), 145-172.
9. Eilenberg, S. (1976) Automata, Languages and Machines, Vol. A, B., (Academic Press, New York).
10. Holub, J., Tliopoulos, C. S., Melichar, B. and Mouchard, L. Distributed string matching using finite automata, Combinatorial Algorithms, AWOCA 99, Perth, 114-127.
11. Kelarev, A. V and Sokratova, O. V (2000) Syntactic semigroups and graph algebras, Bull. Australian Math. Soc. 61, 471-477.
12. Kelarev, A. V. and Trotter, P. G. (2000) A combinatorial property of automata, languages and their syntactic monoids, Words, Languages, and Combinatorics (Kyoto, 14-19 March 2000), Kyoto.
13. Kiss, E. W., Pöschel, R. and Pröhle, P. (1990) Subvarieties of varieties generated by graph algebras, Acta Sci. Math. 54, 57-75.
14. Lallement, G. (1979) Semigroups and Combinatorial Applications (Wiley, New York).
15. Lefebvre, A. and Lecroq, T. Computing repeated factors with factor oracle, Proceedings of 11 Australasian Workshop on Combinatorial Algorithms, AWOCA 2000, University of Newcastle, School of Information Technology, 145-158.
16. Oates-Williaras, S. (1981) Graphs and universal algebra, Lecture Notes Math. 884, 351-354.
17. Pin, J. E. (1989) Formal Properties of Finite Automata and Applications, Lect. Notes Computer Science 386, Springer, New York.
18. Pöschel, R. (1989) The equalional logic for graph algebras, Z. Math. Logik Grundlag Math. 35(3), 273-282.
19. Pöschel, R. and Wessel, W. (1987) Classes of graphs definable by graph algebra identities or quasi-identities, Comment. Math. Univ. Carolinae 28(3), 581-592.
20. Rozenberg, G. and Salomaa, A. (1997) Handbook of Formal Languages Vol. 1, 2, 3 (Springer, New York).
21. Street, A. P. and Wallis, W. D. (1977) Combinatorial Theory: An Introduction, Charles Babbage Research Centre.
22. Thompson, K. (1968) Regular expressions search algorithm, Comm. ACM 11, 410-422.
23. Yu, S. (1997) Regular Languages, Handbook of Formal Languages, Vol. 1 (Springer, New York), 41-110.