BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-82-927
       ENTRY:: June 01, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Combining state machines and regular expressions for
               automatic synthesis of VLSI circuits
        TYPE:: Technical Report
      AUTHOR:: Ullman, Jeffrey D.
        DATE:: September 1982
       PAGES:: 16
    ABSTRACT:: We discuss a system for translating regular expressions into
               logic equations or PLA's, with particular attention to how we
               can obtain both the benefits of regular expressions and state
               machines as input languages. An extended example of the
               method is given, and the results of our approach is compared
               with hand design; in this example we use less than twice the
               area of a hand-designed, machine optimized PLA.
       NOTES:: [Adminitrivia V1/Prg/19950601]
         END:: STAN//CS-TR-82-927