JFP): 218–283, c Cambridge University Press 2014 ⃝ 218

First Page		Document Content
Date: 2016-03-01 06:31:32 Models of computation Formal languages Pushdown automaton Finite automata Nondeterministic finite automaton Computability Abstract interpretation Context-free language Symbol Nested stack automaton Tree stack automaton		JFP): 218–283, c Cambridge University Press 2014 ⃝ 218 Add to Reading List Source URL: ilyasergey.net Download Document from Source Website File Size: 3,45 MB Share Document on Facebook

	Classifying chart cells for quadratic complexity context-free inference Brian Roark and Kristy Hollingshead Center for Spoken Language Understanding Oregon Health & Science University, Beaverton, Oregon, 97006 USA {roark DocID: 1vimU - View Document
	Unary Constraints for Efficient Context-Free Parsing Nathan Bodenstab† Kristy Hollingshead‡ and Brian Roark† † Center for Spoken Language Understanding, Oregon Health & Science University, Portland, OR ‡ Univer DocID: 1v46z - View Document
	Ogden’s Lemma, Multiple Context-Free Grammars, and the Control Language Hierarchy Makoto Kanazawa National Institute of Informatics and SOKENDAI Japan DocID: 1rPym - View Document
	24. Theorietag „Automaten und Formale Sprachen“ Caputh, 23. – 25. September 2014 Henning Bordihn, Bianca Truthe (Hrsg.) DocID: 1rsDZ - View Document
	Sparser, Better, Faster GPU Parsing David Hall Taylor Berg-Kirkpatrick John Canny Dan Klein DocID: 1rnXJ - View Document