BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-75-493
       ENTRY:: August 23, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Describing automata in terms of languages associated with
               their peripheral devices.
        TYPE:: Technical Report
      AUTHOR:: Kurki-Suonio, Reino
        DATE:: May 1975
       PAGES:: 38
    ABSTRACT:: A unified approach is presented to deal with automata having
               different kinds of peripheral devices. This approach is
               applied to pushdown automata and Turing machines, leading to
               elementary proofs of several well-known theorems concerning
               transductions, relationship between pushdown automata and
               context-free languages, as well as homomorphic
               characterization and undecidability questions. In general,
               this approach leads to homomorphic characterization of
               language families generated by a single language by finite
               transduction.
       NOTES:: [Adminitrivia V1/Prg/19950823]
         END:: STAN//CS-TR-75-493