Advertisement

Amore: A system for computing automata, MOnoids, and regular expressions

  • V. Kell
  • A. Maier
  • A. Potthoff
  • W. Thomas
  • U. Wermuth
Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 349)

References

  1. [Pe88]
    D. Perrin, Finite Automata, to appear in: Handbook of Theoretical Computer Science (J. v. Leeuwen, Ed.), North-Holland, Amsterdam.Google Scholar
  2. [Pi84]
    J.E. Pin, Variétés de Langages Formels, Masson, Paris 1984 (Engl. Transl.: Varieties of Formal Languages, North Oxford Acad. Publ., London 1986).Google Scholar
  3. [Su81]
    K. Sugiyama, S. Tagawa, M. Toda, Methods for visual understanding of hierarchical systems, IEEE Trans. Syst. Man Cybern. SMC-11 (1981), 109–125.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • V. Kell
    • 1
  • A. Maier
    • 1
  • A. Potthoff
    • 1
  • W. Thomas
    • 1
  • U. Wermuth
    • 1
  1. 1.Lehrstuhl für Informatik II, RWTH AachenAachen

Personalised recommendations