Skip to main content
SpringerLink
Log in

Control sets on grammars

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

Given a setC of strings of rewriting rules of a phrase structure grammarG, we consider the setL c (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 setL c (G) whenC andG are assumed to have special form. For example, forG an arbitrary phrase structure grammar,L c (G) is an abstract family of languages ifC is an abstract family of languages, andL c (G) is bounded ifC is bounded.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Y. Bar-Hillel, M. Perles andE. Shamir, On formal properties of simple phrase structure grammars,Z. Phonetik Sprachwiss. Kommunikat. 14 (1961), 143–172.

    Google Scholar 

  2. N. Chomsky, Three models for the description of language,IRE Trans. Information Theory IT2 (1956), 113–124.

    Google Scholar 

  3. N. Chomsky, On certain formal properties of grammars,Information and Control 2 (1959), 137–167.

    Google Scholar 

  4. J. Evey, “The theory and application of pushdown store machines”, Mathematical Linguistics and Automatic Translation, Report No. NSF-10, The Computation Laboratory of Harvard University, 1963.

  5. S. Ginsburg andS. Greibach, Mappings which preserve context-sensitive languages,Information and Control 9 (1966), 563–582.

    Google Scholar 

  6. S. Ginsburg andS. Greibach, “Abstract families of languages”, SDC Report No. TM-738/031/00, 17 April 1967.

  7. S. Ginsburg, S. Greibach andM. Harrison, One-way stack automata,J. Assoc. Comput. Mach. 14 (1967), 389–418.

    Google Scholar 

  8. S. Ginsburg andG. F. Rose, Preservation of languages by transducers,Information and Control 9 (1966), 153–176.

    Google Scholar 

  9. S. Ginsburg andE. H. Spanier, BoundedAlgol-like languages,Trans. Amer. Math. Soc. 113 (1964), 333–368.

    Google Scholar 

  10. S. Greibach, A new normal-form theorem for context-free phrase structure grammars,J. Assoc. Comput. Mach. 12 (1965), 42–52.

    Google Scholar 

  11. S. Greibach andJ. Hopcroft, “Independence of AFL operations”, SDC Report No. TM-738/034/00, 12 July 1967.

  12. G. H. Matthews, A note on asymmetry in phrase structure grammars,Information and Control 7 (1964), 360–365.

    Google Scholar 

  13. G. H. Matthews, Two-way languages,Information and Control 10 (1967), 111–119.

    Google Scholar 

  14. M. Rabin andD. Scott, Finite automata and their decision problems,IBM J. Res. Develop. 3 (1959), 114–125.

    Google Scholar 

  15. D. Rosenkrantz, “Programmed grammars—a new device for generating formal languages”, Ph.D. Thesis, Columbia University, 1967.

  16. S. Scheinberg, Note on the Boolean properties of context-free languages,Information and Control 3 (1960), 372–375.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Southern California, USA

    Seymour Ginsburg

  2. System Development Corporation, Santa Monica, California, USA

    Seymour Ginsburg

  3. University of California, Berkeley, USA

    Edwin H. Spanier

  4. System Development Corporation, USA

    Edwin H. Spanier

Authors
  1. Seymour Ginsburg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Edwin H. Spanier
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research sponsored in part by the Air Force Cambridge Research Laboratories, Office of Aerospace Research, USAF, under Contract F1962867C0008, and by the Air Force Office of Scientific Research, Office of Aerospace Research, USAF, under AFOSR Grant No. AF-AFOSR-1203-67.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ginsburg, S., Spanier, E.H. Control sets on grammars. Math. Systems Theory 2, 159–177 (1968). https://doi.org/10.1007/BF01692513

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01692513

Keywords

Search

Navigation