Complexity of recognition in intermediate Level languages

Authors:
William C. Rounds
Affiliations:
-
Venue:
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Year:
1973

Citing 0
Cited 4

Polynomial-time inverse computation for accumulative functions with multiple data traversals

PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
The complexity and generative capacity of lexicalized abstract categorial grammars

LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Dense completeness

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.