<--- Back to Details
First PageDocument Content
Generative linguistics / Noam Chomsky / Combinatory categorial grammar / Categorial grammar / P versus NP problem / Government and binding theory / Syntax / Syntactic category / Transformational grammar / Linguistics / Theoretical computer science / Grammar
Date: 2013-07-01 12:58:45
Generative linguistics
Noam Chomsky
Combinatory categorial grammar
Categorial grammar
P versus NP problem
Government and binding theory
Syntax
Syntactic category
Transformational grammar
Linguistics
Theoretical computer science
Grammar

Interfaces and the Grammar

Add to Reading List

Source URL: www.lingref.com

Download Document from Source Website

File Size: 646,61 KB

Share Document on Facebook

Similar Documents

Computational complexity theory / Logic / Complexity classes / Mathematical logic / PSPACE / FO / Second-order logic / P versus NP problem / Constraint satisfaction problem / NP / P / Constraint satisfaction

Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

DocID: 1ruap - View Document

Computational complexity theory / Theory of computation / Complexity classes / NP / Clique problem / Linear programming / P / Algorithm / Time complexity / Optimization problem / Book:Graph Theory / P versus NP problem

CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time

DocID: 1rfbK - View Document

Linguistics / Language / Cognitive science / Computational linguistics / Natural language processing / Named-entity recognition / Relex / Information extraction / Statistical classification / P versus NP problem / Part-of-speech tagging / Syntax

Mining Relations from Git Commit Messages — an Experience Report Rikard Andersson∗ , Morgan Ericsson†∗ , Anna Wingkvist† ∗ Chalmers | University of Gothenburg Gothenburg, Sweden

DocID: 1r8NA - View Document

Computational complexity theory / Theory of computation / Complexity classes / Structural complexity theory / Conjectures / Probability distributions / NP / Polynomial hierarchy / IP / P versus NP problem / PP / P

ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWz

DocID: 1qYTn - View Document

Cryptography / Computational complexity theory / Knapsack problem / Cipher / Public-key cryptography / Encryption / Symmetric-key algorithm / Key / P versus NP problem / MerkleHellman knapsack cryptosystem / RSA

Public Key Cryptography Public Key Cryptography • Symmetric Key: – Same key used for encryption and decrypiton – Same key used for message integrity and validation

DocID: 1qJPm - View Document