A programming language for symbolic computation of regular languages, automata and semigroups

  • Juris Matthias Champarnaud
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 577)


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].


  1. [1]
    Champarnaud J.M. and G. Hansel, AUTOMATE, a computing package for automata and finite semigroups, J. Symbolic Computation, 12, 1991, 197–220.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Juris Matthias Champarnaud
    • 1
  1. 1.I.B.P., L.I.T.P., Université Paris 7Paris Cedex 05France

Personalised recommendations