Advertisement

The contextsensitivity bounds of contextsensitive grammars and languages

  • Franz-Josef Brandenburg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 52)

Abstract

In this paper we study the derivational complexity of contextsensitive grammars and languages by placing bounds on their contextsensitivity. The contextsensitivity of a grammar is defined on its derivations, and it is determined by the maximal length of the strings of ancestors of any symbol occurring at any position of the derived strings. A total recursive function f bounds the (right-) contextsensitivity function of grammar G, if for every terminal string x of length n generated by G there is a (right-canonical) derivation from S to x in G whose contextsensitivity is less than or equal to f(n).

We investigate lower and upper bounding functions for the right-contextsensitivity functions of contextsensitive grammars and languages and study the families of context-sensitive languages with right-contextsensitivity functions bounded by some particular sublinear functions f.

References

  1. R.V. Book (1969), Grammars with time functions, "Mathematical Linguistics and Automatic Translation, NSF 23", Harvard University Cambridge, Mass., 1969.Google Scholar
  2. R.V. Book (1971), Time-bounded grammars and their languages, J. Comput. System Sci. 5 (1971), 397–429.Google Scholar
  3. R.V. Book (1973), On the structure of context-sensitive grammars, Internat. J. Comput. Information Sci. 2 (1973), 129–139.Google Scholar
  4. F.J. Brandenburg (1977), On one-way auxiliary pushdown automata, Proceedings 3rd GI Conference Theoretical Computer Science, in: Lecture Notes in Computer Science, 48 (1977), 132–144.Google Scholar
  5. H.W. Buttelmann (1975), On the syntactic structures of unrestricted grammars, I. Generative grammars and phrase structure grammars. Information and Control 29 (1975), 29–80.Google Scholar
  6. M.P. Chytil (1976), Analysis of the non-context-free component of formal languages, Proceedings 5th Symposium Mathematical Foundations of Computer Science 1976, in: Lecture Notes in Computer Science 45 (1976), 230–236.Google Scholar
  7. S.A. Cook (1971), Characterization of pushdown machines in terms of time-bounded computers. J. Assoc. Comput. Mach. 18 (1971), 4–18.Google Scholar
  8. S. Ginsburg, E.H. Spanier (1968), Derivation-bounded languages, J. Comput. System Sci. 2 (1968), 218–250.Google Scholar
  9. T.V. Griffiths (1968), Some remarks on derivations in general rewriting systems, Information and Control 12 (1968), 27–54.Google Scholar
  10. F.C. Hennie (1965), One-tape, off-line Turing machine computations, Information and Control 8 (1965), 533–546.Google Scholar
  11. J.E. Hopcroft, J.D. Ullman (1969), Formal languages and their relation to automata, Addison-Wesley Publishing Company (1969).Google Scholar
  12. G. Wechsung (1975), Characterization of some classes of context-free languages in terms of complexity classes. Proceedings 4th Symposium Mathematical Foundations of Computer Science 1975, in: Lecture Notes in Computer Science 32 (1975), 457–461.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Franz-Josef Brandenburg
    • 1
  1. 1.Institut für Informatik der Universität BonnBonnWest Germany

Personalised recommendations