Advertisement

Mathematical systems theory

, Volume 2, Issue 3, pp 191–194 | Cite as

A helpful result for proving inherent ambiguity

  • William Ogden
Article

Keywords

Computational Mathematic Inherent Ambiguity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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. [2]
    N. Chomsky, Formal properties of grammars.Handbook of Mathematical Psychology, Vol. 2 (edited by R. D. Luce, R. Bush, and E. Galanter), John Wiley and Sons, Inc., New York, 1963.Google Scholar
  3. [3]
    S. Ginsburg,The Mathematical Theory of Context-Free Languages. McGraw-Hill Book Company, New York, 1966.Google Scholar
  4. [4]
    S. Ginsburg andJ. S. Ullian, Ambiguity in context-free languages.J. Assoc. Comput. Mach. 13 (1966), 62–89.Google Scholar
  5. [5]
    R. J. Parikh, Language generating devices.MIT Res. Lab. Electron. Quart. Prog. Rep. 60 (1961), 199–212.Google Scholar

Copyright information

© Springer-Verlag New York Inc 1968

Authors and Affiliations

  • William Ogden
    • 1
  1. 1.Stanford UniversityUSA

Personalised recommendations