@inbook{d3d88f648e7d44929424d901b7dd7e4b,
title = "Computational Complexity in Natural Language",
keywords = "Computational complexity in natural language, Context-free grammar (CFG), quadruple G = N,Σ, S, P, and N as set of non-terminals, Definite clause grammars (DCGs), Determining logical relationships - between sentences in natural language, Logical relationship between sentences, Monadic second-order logic (MSO), formal language with two variables, Physical realization of corresponding processes in humans - legitimate study, Relations between complexity classes, Turing machines and models of computation, Universal recognition problem and fixed-language recognition problem - grammar frameworks",
author = "Ian Pratt-Hartmann",
year = "2010",
month = jun,
day = "29",
doi = "10.1002/9781444324044.ch2",
language = "English",
pages = "43--73",
booktitle = "The Handbook of Computational Linguistics and Natural Language Processing|The Handb. of Comput. Linguist. and Nat. Lang. Proces.",
publisher = "John Wiley & Sons Ltd",
address = "United Kingdom",
}