Turn-Bounded Grammars and Their Relation to Ultralinear Languages
暂无分享,去创建一个
[1] Ranan B. Banerji,et al. Phrase Structure Languages, Finite Machines, and Channel Capacity , 1963, Inf. Control..
[2] Arthur C. Fleck,et al. On the Combinatorial Complexity of Context-free Grammars , 1971, IFIP Congress.
[3] S. Ginsburg,et al. Finite-Turn Pushdown Automata , 1966 .
[4] Etsuro Moriya,et al. Associate Languages and Derivational Complexity of Formal Grammars and Languages , 1973, Inf. Control..
[5] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .
[6] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.
[7] Sheila A. Greibach,et al. A New Normal-Form Theorem for Context-Free Phrase Structure Grammars , 1965, JACM.
[8] Ranan B. Banerji,et al. Some Problems of Finite Representability , 1965, Inf. Control..