How to Make Arbitrary Grammars Look Like Context-Free Grammars

Abstract

Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 29 June 1972Published online: 13 July 2006Keywordsphrase-structure grammar, normal form theorem, recursively enumerable set, context-free grammar, pushdown automata, bracketed grammarPublication DataISSN (print): 0097-5397ISSN (online): 1095-7111Publisher: Society for Industrial and Applied MathematicsCODEN: smjcat