Chapter PDF
Keywords
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.
References
Gladkii A.V., Formal grammars and languages, M., Nauka, 1973 (russ.) — in translation into English by North-Holland P.Co.
Modina L.S., On dependency ambiguity of context-free languages, in print (russ.)
Modina L.S., On some formal grammars generating dependency trees, Lecture Notes in Computer Sci., 32, Berlin-Heidelberg-New-York, 1975, 326–329.
Modina L.S., On degrees of dependency ambiguity, unpublished manuscript.
Modina L.S., Dendrogrammars and dendrolanguages, Kibernetika (Kiev), 1975, N5, 86–93 (russ.)
Melčuk I.A., Experiment of the theory of linguistic models "Meaning ⇔Text", M., Nauka, 1974 (russ.)
Modina L.S., On some formal systems generating dependency trees, Problemy Peredači Informacii, 1976, 12, N2, 83–94 (russ.)
Greibach S.A., A new normal-form theorem for context-free phrase structure grammars, J.Assoc.Comput.Mach., 1965, 12, N1, 42–52.
Ogden W., A helpfull result for proving inherent ambiguity, Math.Syst.Theory, 1968, 2, N3, 191–194.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dikovskii, A.J., Modina, L.S. (1977). On three types of unambiguity of context-free language. In: Salomaa, A., Steinby, M. (eds) Automata, Languages and Programming. ICALP 1977. Lecture Notes in Computer Science, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08342-1_15
Download citation
DOI: https://doi.org/10.1007/3-540-08342-1_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08342-9
Online ISBN: 978-3-540-37305-6
eBook Packages: Springer Book Archive