• DocumentCode
    2203371
  • Title

    Relationships between monadic recursion schemes and deterministic context-free languages

  • Author

    Friedman, Emily P.

  • fYear
    1974
  • fDate
    14-16 Oct. 1974
  • Firstpage
    43
  • Lastpage
    51
  • Abstract
    The equivalence problem for languages accepted by deterministic pushdown automata is shown to be decidable if and only if the strong equivalence problem for monadic recursion schemes is decidable. The proof is obtained through a series of reductions, and several different classes of acceptors are introduced.
  • Keywords
    Automata; Delay; Tellurium;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Switching and Automata Theory, 1974., IEEE Conference Record of 15th Annual Symposium on
  • Conference_Location
    USA
  • ISSN
    0272-4847
  • Type

    conf

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