Ogden's Lemma for Monterminal Bounded Languages
暂无分享,去创建一个
[1] Sheila A. Greibach,et al. The Unsolvability of the Recognition of Linear Context-Free Languages , 1966, JACM.
[2] Luc Boasson,et al. On languages satisfying Ogden's lemma , 1978, RAIRO Theor. Informatics Appl..
[3] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[4] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .
[5] Sheila A. Greibach,et al. Linearity is Polynomially Decidable for Realtime Pushdown Store Automatia , 1979, Inf. Control..