• DocumentCode
    2199379
  • Title

    Transformation of program schrmes to standard forms

  • Author

    Basu, S.K.

  • fYear
    1968
  • fDate
    15-18 Oct. 1968
  • Firstpage
    99
  • Lastpage
    105
  • Abstract
    Program schemes are represented as directed, labeled graphs over some vocabulary. Such schemes are transformed to block form by obtaining a regular expression from the graph and translating it to block form by using a recursive correspondence. A necessary and sufficient condition is given for the transformed graph to be deterministic.
  • Keywords
    Computational complexity; Flow graphs; Sufficient conditions; Tiles; Vocabulary;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Switching and Automata Theory, 1968., IEEE Conference Record of 9th Annual Symposium on
  • Conference_Location
    Schenedtady, NY, USA
  • ISSN
    0272-4847
  • Type

    conf

  • DOI
    10.1109/SWAT.1968.38
  • Filename
    4569561
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2199379