BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-71-217
       ENTRY:: November 01, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Decidable properties of monadic functional schemas
        TYPE:: Technical Report
      AUTHOR:: Ashcroft, Edward A.
      AUTHOR:: Manna, Zohar
      AUTHOR:: Pneuli, Amir
        DATE:: July 1971
       PAGES:: 11
    ABSTRACT:: We define a class of (monadic) functional schemas which
               properly includes 'Ianov' flowchart schemas. We show that the
               termination, divergence and freedom problems for functional
               schemas are decidable. Although it is possible to translate a
               large class of non-free functional schemas into equivalent
               free functional schemas, we show that this cannot be done in
               general. We show also that the equivalence problem for free
               functional schemas is decidable. Most of the results are
               obtained from well-known results in Formal Languages and
               Automata Theory.
       NOTES:: [Adminitrivia V1/Prg/19951101]
         END:: STAN//CS-TR-71-217