Abstract
We describe a programming language designed for symbolic computation of regular languages, extended regular expressions, finite automata, and finite semigroups. An interpreter has been written in C and implemented on the VAX/780 of the L.I.T.P. running under UNIX. It has been constructed with the help of lexical analyser generator Lex and LALR parser generator Yacc. It makes use of the functions defined in the libraries of the AUTOMATE package [1].
This is a preview of subscription content, log in via an institution to check access.
Reference
Champarnaud J.M. and G. Hansel, AUTOMATE, a computing package for automata and finite semigroups, J. Symbolic Computation, 12, 1991, 197–220.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Champarnaud, J.M. (1992). A programming language for symbolic computation of regular languages, automata and semigroups. In: Finkel, A., Jantzen, M. (eds) STACS 92. STACS 1992. Lecture Notes in Computer Science, vol 577. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_217
Download citation
DOI: https://doi.org/10.1007/3-540-55210-3_217
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55210-9
Online ISBN: 978-3-540-46775-5
eBook Packages: Springer Book Archive