Three theorems on phrase structure grammars of type 1

DOI10.1016/S0019-9958(63)90169-4zbMath0116.11702WikidataQ63244994 ScholiaQ63244994MaRDI QIDQ5725164

Peter S. Landweber

Publication date: 1963

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

applications of probability theory and statistics

Related Items

The theory of languages, Context-free languages and rudimentary attributes, The theory of languages, Unnamed Item, Unnamed Item, Modal and mixed specifications: key decision problems and their complexities, Unnamed Item, Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages, On the complexity of formal grammars, Inference of bounded L systems with polymorphic P systems, Vier Entscheidbarkeitsprobleme für kontextsensitive Sprachen, Zerlegungen von Semi-Thue-Systemen, A generator of context-sensitive languages, Time-bounded grammars and their languages, Pushdown cellular automata