On Descriptive Complexity, Language Complexity, and GB

  title={On Descriptive Complexity, Language Complexity, and GB},
  author={James Rogers},
We introduce L K P a monadic second order language for reasoning about trees which char acterizes the strongly Context Free Languages in the sense that a set of nite trees is de n able in L K P i it is modulo a projection a Local Set the set of derivation trees generated by a CFG This provides a exible approach to establishing language theoretic complexity results for formalisms that are based on systems of well formedness constraints on trees We demonstrate this technique by sketching two such… CONTINUE READING


Publications referenced by this paper.
Showing 1-9 of 9 references

Θ - theory and arguments

Robert C. Berwick
Linguistic Inquiry • 1993

Scandinavian extraction phenomena revisited : Weak and strong generative capacity

Philip H. Miller
Locality : A Theory and Some of Its Empirical Consequences • 1992

Pullum and Gerald Gazdar . Natural language and context - free languages

K. Geoffrey
Linguistics and Philosophy • 1991

Kaplan , Stanley Peters , and Annie Zaenen . Cross - serial dependencies in Dutch

Michael Brody
Linguistic Inquiry • 1982

Pullum . On two recent attempts to show that English is not a CFL

K Geoffery
Linguistics and Philosophy • 1982

Lapointe . Recursiveness and deletion

G. Steven
Journal of Logic , Language , and Information , to appear

Shieber . Evidence against the context - freeness of natural language

M Stuart
Relativized Minimality

Similar Papers

Loading similar papers…