A helpful result for proving inherent ambiguity-Reference-Cited by-同舟云学术

A helpful result for proving inherent ambiguity

Published:1968-09 Issue:3 Volume:2 Page:191-194
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Ogden William

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01694004.pdf

Reference5 articles.

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

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.

3. S. Ginsburg,The Mathematical Theory of Context-Free Languages. McGraw-Hill Book Company, New York, 1966.

4. S. Ginsburg andJ. S. Ullian, Ambiguity in context-free languages.J. Assoc. Comput. Mach. 13 (1966), 62–89.

5. R. J. Parikh, Language generating devices.MIT Res. Lab. Electron. Quart. Prog. Rep. 60 (1961), 199–212.

Cited by 112 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An ambiguity hierarchy of weighted context-free grammars;Theoretical Computer Science;2023-09

2. Re-examining regular expressions with backreferences;Theoretical Computer Science;2023-01

3. Automatic winning shifts;Information and Computation;2022-05

4. Coverability, Termination, and Finiteness in Recursive Petri Nets;Fundamenta Informaticae;2022-01-10

5. An Ambiguity Hierarchy of Weighted Context-Free Grammars;Implementation and Application of Automata;2022