• DocumentCode
    2200349
  • Title

    Recognition of context-free and stack languages

  • Author

    Kosaraju, S.R.

  • fYear
    1969
  • fDate
    15-17 Oct. 1969
  • Firstpage
    129
  • Lastpage
    132
  • Abstract
    This paper is concerned with the recognition of Context-free and deterministic 1-way stack (sa) languages, using n-dimensional Iterative Finitestate Automata (n-D IFA). A problem posed by Cole3 is also answered.
  • Keywords
    Automata; Magnetic heads; Printing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Switching and Automata Theory, 1969., IEEE Conference Record of 10th Annual Symposium on
  • Conference_Location
    Waterloo, ON, Canada
  • ISSN
    0272-4847
  • Type

    conf

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