Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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']
I am writing a research paper on a idea Complexity of recognition in intermediate Level languages
[{"from": "human", "value": "I am writing a research paper on a idea Complexity of recognition in intermediate Level languages"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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."}]