论文信息 - ɛ-productions in context-free grammars

ɛ-productions in context-free grammars

SummaryThe effect of ɛ-productions on the space complexity of various context-free language problems is investigated. It is shown that the removal of ɛ-productions from a context-free grammar can probably not be achieved with small storage space. This explains the apparent discrepancy between two different results in the literature on the membership problem. By way of contrast, it is shown that the space complexity of the emptiness and the finiteness problems are independent of the presence of ɛ-productions.

Leslie M. Goldschlager | L. Goldschlager

[1] Zvi Galil,et al. Hierarchies of complete problems , 1976, Acta Informatica.

[2] Leslie M. Goldschlager,et al. A unified approach to models of synchronous parallel machines , 1978, STOC.

[3] L. Goldschlager. The monotone and planar circuit value problems are log space complete for P , 1977, SIGA.

[4] R. Ladner. The circuit value problem is log space complete for P , 1975, SIGA.

[5] Leslie M. Goldschlager,et al. A Space Efficient Algorithm for the Monotone Planar Circuit Value Problem , 1980, Information Processing Letters.

[6] Stephen A. Cook,et al. An observation on time-storage trade off , 1973, J. Comput. Syst. Sci..

[7] Richard Edwin Stearns,et al. Memory bounds for recognition of context-free and context-sensitive languages , 1965, SWCT.

[8] Richard J. Lipton,et al. Linear Programming is Log-Space Hard for P , 1979, Inf. Process. Lett..

[9] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[10] Neil D. Jones,et al. Complete problems for deterministic polynomial time , 1974, STOC '74.