论文信息 - Control sets on grammars

Control sets on grammars

Given a setC of strings of rewriting rules of a phrase structure grammarG, we consider the setLc(G) of those words generated by leftmost derivations inG whose corresponding string of rewriting rules is an element ofC. The paper concerns the nature of the setLc(G) whenC andG are assumed to have special form. For example, forG an arbitrary phrase structure grammar,Lc(G) is an abstract family of languages ifC is an abstract family of languages, andLc(G) is bounded ifC is bounded.

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

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

[2] Seymour Ginsburg,et al. Mappings which Preserve Context Sensitive Languages , 1966, Inf. Control..

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

[4] Sheila A. Greibach,et al. A New Normal-Form Theorem for Context-Free Phrase Structure Grammars , 1965, JACM.

[5] S. Ginsburg,et al. BOUNDED ALGOL-LIKE LANGUAGES^) , 1964 .

[6] Seymour Ginsburg,et al. Preservation of Languages by Transducers , 1966, Inf. Control..

[8] Alaa A. Kharbouch,et al. Three models for the description of language , 1956, IRE Trans. Inf. Theory.

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

[10] Seymour Ginsburg,et al. One-way stack automata , 1967, JACM.

[11] Daniel J. Rosenkrantz,et al. Programmed Grammars: A New Device for Generating Formal Languages , 1967, SWAT.

[12] G. H. Matthews. Two-Way Languages , 1967, Inf. Control..

[13] Seymour Ginsburg,et al. Abstract Families of Languages , 1967, SWAT.

[14] G. H. Matthews. A Note on Assymmetry in Phrase Structure Grammars , 1964, Inf. Control..

[15] S. Ginsburg,et al. Bounded -like languages , 1964 .