Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 79, 2002 - Issue 12
Submit an article Journal homepage
33
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

Two Algorithms For Languages Recognized By Graph Algebras

A. V. Kelarev Department of Mathematics, University of Tasmania, GPO Box 252-37, Hobart, Tasmania, 7001, Australia
&
O. V. Sokratova Institute of Computer Science, University of Tartu, J. Liivi 2, Tartu, 50409, Estonia
Pages 1317-1327 | Published online: 15 Sep 2010

  • Aho , A. V , Hopcroft , J. and Ullman , J. D. 1974 . The Design and Analysis of Computer Algorithms , Reading : Addison- Wesley .
  • Aho , A. V , Sethi , R. and Ullman , J. D. 1986 . Compilers-Principles, Techniques, and Tools , Reading : Addison-Wesley .
  • Aifoib , M. A. 1968 . Algebraic Theory of Machines, Languages, and Semigroups , New York : Academic Press .
  • Berstel , J. 1989 . Finite automata and rational languages: an introduction. In Formal Properties of Finite Automata and Applications , Lect Notes Computer Science 386 New York : Springer .
  • Chang , C. H. and Paige , R. From regular expressions to DFA's using compressed NFA's . Proc. Third Symposium on Combinatorial Pattern Matching . pp. 90 – 110 .
  • Berry , G. and Sethi , R. 1986 . From regular expressions to deterministic automata . Theoret. Camp. Sci. , 48 : 117 – 126 .
  • Brüggeman-Klein , A. 1993 . Regular expressions into finite automata . Theoret. Comp. Sci. , 120 : 197 – 213 .
  • 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 .
  • Eilenberg , S. 1976 . Automata, Languages and Machines , New York : A B. Academic Press .
  • Holub , J. , Iliopoulos , C. S. , Melichar , B. and Mouchard , L. Distributed string matching using finite automata . Combinatorial Algorithms, AWOCA , 99 114 – 127 . Perth
  • Kelarev , A. V and Sokratova , O. V . 2000 . Syntactic semigroups and graph algebras . Bull. Australian Math. SOc. , 62 : 471 – 477 .
  • 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
  • Kiss , E. W. , Poschel , R. and Prohle , P. 1990 . Subvarieties of varieties generated by graph algebras . Acta Set. Math. , 54 : 57 – 75 .
  • Lallement , G. 1979 . Semigroups and Combinatorial Applications , New York : Wiley .
  • Lefebvre , A. and Lecroq , T. Computing repeated factors with factor oracle . Proceedings of 11 Australasian Workshop on Combinatorial Algorithms, AWOCA 2000 . pp. 145 – 158 . University of Newcastle, School of Information Technology .
  • Oates-Williams , S. 1981 . Graphs and universal algebra . Lecture Notes Math. , 884 : 351 – 354 .
  • Pin , J. E. 1989 . Formal Properties of Finite Automata and Applications , Lect Notes Computer Science 386 New York : Springer .
  • Poschel , R. 1989 . The equational logic for graph algebras, Z Math . Logik Grundlag Math , 35 (3} ) : 273 – 282 .
  • Poschel , R. and Wessel , W. 1987 . Classes of graphs definable by graph algebra identities or quasi-identities, Comment . Math. Univ. Carolinae , 28 (3} ) : 581 – 592 .
  • Rozenberg , G. and Salomaa , A. 1997 . Handbook of Formal Languages , Vol. 1, 2, 3 , New York : Springer .
  • Street , A. P. and Wallis , W. D. 1977 . Combinatorial Theory: An Introduction , Charles Babbage Research Centre .
  • Thompson , K. 1968 . Regular expressions search algorithm . Canon. ACM , 11 : 410 – 422 .
  • Yu , S. 1997 . Regular Languages, Handbook of Formal Languages , Vol. 1 , 41 – 110 . New York : Springer .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.