Context-Limited Grammars
暂无分享,去创建一个
[1] Sheila A. Greibach,et al. A New Normal-Form Theorem for Context-Free Phrase Structure Grammars , 1965, JACM.
[2] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .
[3] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.
[4] Thomas V. Griffiths. Turing machine recognizers for general rewriting systems , 1964, SWCT.
[5] Jacques Loeckx,et al. The Parsing for General Phrase-Structure Grammars , 1970, Inf. Control..
[6] Seymour Ginsburg,et al. Operations Which Preserve Definability in Languages , 1963, JACM.
[7] Joseph S. Ullian,et al. Preservation of unambiguity and inherent ambiguity in context-free languages , 1966, JACM.
[8] Oystein Ore,et al. Graphs and Their Uses , 1964 .
[9] Thomas N. Hibbard,et al. A Generalization of Context-Free Determinism , 1967, Inf. Control..
[10] Seymour Ginsburg,et al. Mappings which Preserve Context Sensitive Languages , 1966, Inf. Control..