论文信息 - Quotients of Context-Free Languages

Quotients of Context-Free Languages

Abstract : The following results on the quotient of context free languages CFL are shown: (1) It is recursively unsolvable to determine for arbitrary CFL whether the quotient of one by another is a CFL. (2) If either set is regular and the other is a CFL, then the quotient is a CFL. (Author)

Seymour Ginsburg | Edwin H. Spanier | S. Ginsburg | E. Spanier

[1] Seymour Ginsburg,et al. Operations Which Preserve Definability in Languages , 1963, JACM.

[2] Seymour Ginsburg,et al. Two Families of Languages Related to ALGOL , 1962, JACM.

[3] Calvin C. Elgot,et al. Operations of finite automata , 1961, SWCT.

[4] Stephen Scheinberg,et al. Note on the Boolean Properties of Context Free Languages , 1960, Inf. Control..

[5] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[6] Emil L. Post. A variant of a recursively unsolvable problem , 1946 .

[7] Seymour Ginsburg,et al. Some Recursively Unsolvable Problems in ALGOL-Like Languages , 1963, JACM.

[8] Noam Chomsky,et al. Three models for the description of language , 1956, IRE Trans. Inf. Theory.

[9] Noam Chomsky,et al. On Certain Formal Properties of Grammars , 1959, Inf. Control..

[10] E. Shamir,et al. ON SEQUENTIAL LANGUAGES , 1961 .

[11] S C Kleene,et al. Representation of Events in Nerve Nets and Finite Automata , 1951 .