On the transformation of derivation graphs to derivation trees

Preliminary report
  • Franz-Josef Brandenburg
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)


Derivation graphs of arbitrary grammars are transformed into trees. The transformations are based on the notion of ancestors, mapping subderivations into single nodes. Using the weight and the diameter of these nodes as parameters two new complexity measures on grammars are introduced, which are compared with the time and the space complexity measures of nondeterministic turing machines.


Turing Machine Regular Language Derivation Tree Ancestor Node Formal Language Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R.V. Book, Time-bounded grammars and their languages. J. Comput. System Sciences 5, 397–418 (1971).Google Scholar
  2. 2.
    F.J. Brandenburg, On one-way auxiliary pushdown automata. Lecture Notes in Computer Science 48, 132–144 (1977).Google Scholar
  3. 3.
    F.J. Brandenburg, The contextsensitivity bounds of contextsensitive grammars and languages. Lecture Notes in Computer Science 52, 120–132 (1977).Google Scholar
  4. 4.
    F.J. Brandenburg, Die Zusammenhangskomplexität von nicht-kontext-freien Grammatiken. Dissertation, Universität Bonn (1978).Google Scholar
  5. 5.
    F.J. Brandenburg, On the height of syntactical graphs. Lecture Notes in Computer Science 104, 13–21 (1981).Google Scholar
  6. 6.
    K. Culik II and H.A. Maurer, On the height of derivation trees. Forschungsbericht Nr. 18, Institut für Informationsverarbeitung, TU Graz (1978).Google Scholar
  7. 7.
    M.A. Harrison, Introduction to Formal Language Theory. Addison-Wesley, Reading (1978).Google Scholar
  8. 8.
    J.M. Hart, Derivation languages and syntactic categories. Information and Control 28, 204–220 (1975).Google Scholar
  9. 9.
    J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979).Google Scholar
  10. 10.
    G. Hotz, Eindeutigkeit und Mehrdeutigkeit formaler Sprachen. Elektron. Informationsverarbeitung Kybernetik 2, 235–246 (1966).Google Scholar
  11. 11.
    Y. Igarashi, General properties of derivational complexity. Acta Informatica 8, 267–283 (1977).Google Scholar
  12. 12.
    T. Kamimura and G. Slutzki, DAGs and Chomsky hierarchy. Lecture Notes in Computer Science 71, 331–337 (1979).Google Scholar
  13. 13.
    J. Loeckx, The parsing of general phrase-structure grammars. Information and Control 16, 443–464 (1970).Google Scholar
  14. 14.
    M. Paterson, personal communication to H.A. Maurer.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Franz-Josef Brandenburg
    • 1
  1. 1.Institut fuer InformatikUniversitaet BonnBonnFederal Republic of Germany

Personalised recommendations