论文信息 - Complexity of Recognition in Intermediate-Level Languages

Complexity of Recognition in Intermediate-Level Languages

Complexity of sentence recognition is studied for one-way stack languages, indexed languages, and tree transducer languages. The problem is shown to be polynomial-complete in each case. A class of naturallanguage grammars is formalized and the sentence-recognition problem is shown to be polynomial-hard although the languages are context-sensitive. The proofs give new language-theoretic characterizations of the set of satisfiable propositional formulas and the set of prepositional tautologies.

William C. Rounds | W. Rounds

[1] Noam Chomsky,et al. Three models for the description of language , 1956, IRE Trans. Inf. Theory.

[2] Arto Salomaa,et al. Two Complete Axiom Systems for the Algebra of Regular Events , 1966, JACM.

[3] James W. Thatcher,et al. Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory , 1967, J. Comput. Syst. Sci..

[4] Alfred V. Aho,et al. Indexed Grammars—An Extension of Context-Free Grammars , 1967, SWAT.

[5] James W. Thatcher,et al. Generalized Sequential Machine Maps , 1970, J. Comput. Syst. Sci..

[6] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[7] Michael A. Harrison,et al. A Grammatical Characterization of One-Way Nondeterministic Stack Languages , 1971, JACM.

[8] Arto Salomaa. The Generative Capacity of Transformational Grammars of Ginsburg and Partee , 1971, Inf. Control..

[9] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[10] P. Stanley Peters,et al. On the generative power of transformational grammars , 1973, Inf. Sci..

[11] Harry B. Hunt,et al. On the time and tape complexity of languages I , 1973, STOC.

[12] Brenda S. Baker,et al. Tree transductions and families of tree languages , 1973, STOC.