This is a preview of subscription content, log in via an institution.
References
D. Perrin, Finite Automata, to appear in: Handbook of Theoretical Computer Science (J. v. Leeuwen, Ed.), North-Holland, Amsterdam.
J.E. Pin, Variétés de Langages Formels, Masson, Paris 1984 (Engl. Transl.: Varieties of Formal Languages, North Oxford Acad. Publ., London 1986).
K. Sugiyama, S. Tagawa, M. Toda, Methods for visual understanding of hierarchical systems, IEEE Trans. Syst. Man Cybern. SMC-11 (1981), 109–125.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kell, V., Maier, A., Potthoff, A., Thomas, W., Wermuth, U. (1989). Amore: A system for computing automata, MOnoids, and regular expressions. In: Monien, B., Cori, R. (eds) STACS 89. STACS 1989. Lecture Notes in Computer Science, vol 349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029017
Download citation
DOI: https://doi.org/10.1007/BFb0029017
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50840-3
Online ISBN: 978-3-540-46098-5
eBook Packages: Springer Book Archive