• DocumentCode
    2199755
  • Title

    Grammars with linear time functions

  • Author

    Book, Ronald V.

  • fYear
    1968
  • fDate
    15-18 Oct. 1968
  • Firstpage
    298
  • Lastpage
    305
  • Abstract
    In this paper we consider the family of all languages generated by context-sensitive grammars whose time functions are linear-bounded. It is shown that this family is an AFL closed under reversal, and we show its relationship to several well-studied families of formal languages.
  • Keywords
    Automata; Books; Counting circuits; Formal languages; Scattering; Turing machines;
  • 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.11
  • Filename
    4569577
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2199755