Security Applications of Formal Language Theory Dartmouth Computer Science Technical Report TR2011-709 Len Sassaman, Meredith L. Patterson, Sergey Bratus, Michael E. Locasto, Anna Shubina

First Page		Document Content
Date: 2011-12-01 11:57:54 Mathematics Deterministic pushdown automaton Parsing Computability Context-free grammar Context-free language Formal grammar Finite-state machine Recursive language Formal languages Theoretical computer science Theory of computation		Security Applications of Formal Language Theory Dartmouth Computer Science Technical Report TR2011-709 Len Sassaman, Meredith L. Patterson, Sergey Bratus, Michael E. Locasto, Anna Shubina Add to Reading List Source URL: langsec.org Download Document from Source Website File Size: 498,18 KB 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