• DocumentCode
    2199737
  • Title

    Two-way balloon automata and AFL

  • Author

    Ginsburg, Seymour ; Hopcroft, John

  • fYear
    1968
  • fDate
    15-18 Oct. 1968
  • Firstpage
    292
  • Lastpage
    297
  • Abstract
    It is shown that if the family of languages accepted by a closed class of two-way balloon automata is closed under length-preserving homomorphism, then this family is an AFL closed under intersection and ε-free substitution. It is then proved that the family of languages accepted by the closed class of (nonerasing) (deterministic) stack acceptors is such a family.
  • Keywords
    Automata; Forward contracts; Laboratories; Storage automation;
  • 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.41
  • Filename
    4569576
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2199737