Acta Informatica

, Volume 8, Issue 3, pp 267–283

General properties of derivational complexity

  • Yoshihide Igarashi
Article

DOI: 10.1007/BF00264470

Cite this article as:
Igarashi, Y. Acta Informatica (1977) 8: 267. doi:10.1007/BF00264470

Summary

The purpose of this paper is to establish a certain correspondence between shortest derivations of phrase structure grammars and Turing machine computations, and to show how to connect the derivational complexity introduced by Gladkij to Blum's axioms for partial recursive functions and their step-counting functions. It is shown that main theorems on Blum's axiomatic theory of computational complexity can be transfered to the case of derivational complexity.

Copyright information

© Springer-Verlag 1977

Authors and Affiliations

  • Yoshihide Igarashi
    • 1
  1. 1.Centre for Computer StudiesUniversity of LeedsLeedsEngland