Title :
Grammars with linear time functions
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;
Conference_Titel :
Switching and Automata Theory, 1968., IEEE Conference Record of 9th Annual Symposium on
Conference_Location :
Schenedtady, NY, USA
DOI :
10.1109/SWAT.1968.11
