论文信息 - General properties of derivational complexity

General properties of derivational complexity

SummaryThe 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.

Yoshihide Igarashi | Y. Igarashi

[1] Ronald V. Book. Time-Bounded Grammars and Their Languages , 1971, J. Comput. Syst. Sci..

[2] Hartley Rogers,et al. Gödel numberings of partial recursive functions , 1958, Journal of Symbolic Logic.

[3] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[4] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .

[5] Arto Salomaa,et al. Formal languages , 1973, Computer science classics.

[6] V. Rich. Personal communication , 1989, Nature.

[7] Allan Borodin,et al. Computational Complexity and the Existence of Complexity Gaps , 1972, JACM.

[8] Manuel Blum,et al. A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[9] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .

[10] S. S. Marchenkov,et al. Complexity of algorithms and computations , 1981 .

[11] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[12] Juris Hartmanis,et al. An Overview of the Theory of Computational Complexity , 1971, JACM.