Hostname: page-component-76fb5796d-dfsvx Total loading time: 0 Render date: 2024-04-25T09:05:47.052Z Has data issue: false hasContentIssue false
  • English
  • Français

Branching processes with terminal types: application to context-free grammars

Published online by Cambridge University Press:  14 July 2016

David Sankoff
David Sankoff*
Affiliation:
Centre de recherche mathématiques, Université de Montréal
Get access Rights & Permissions [Opens in a new window]

Extract

In this note we consider multi-type branching processes where certain terminal types of particles, once created, are subject neither to death nor to further reproduction.

Type
Research Papers
Information
Journal of Applied Probability , Volume 8 , Issue 2 , June 1971 , pp. 233 - 240
Copyright
Copyright © Applied Probability Trust 1971 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Ginsburg, S. (1966) The Mathematical Theory of Context-free Languages. McGraw-Hill, New York.Google Scholar
[2] Griffiths, T. V. and Petrick, S. R. (1965) On the relative efficiencies of context-free grammar recognizers. Comm. ACM 8, 289–300.Google Scholar
[3] Harris, T. E. (1963) The Theory of Branching Processes. Springer-Verlag, Berlin; Prentice-Hall, Englewood Cliffs, N.J. Google Scholar
[4] Horning, J. J. (1969) A study of grammatical inference. Technical Report No. CS 139, Stanford Artificial Intelligence Project, Memo A1–98. Computer Science Department, School of Humanities and Sciences, Stanford University.Google Scholar
[5] Jacobs, R. A. and Rosenbaum, P. S. (1968) English Transformational Grammar. Blaisdell, Waltham, Mass.Google Scholar
[6] Karlin, S. (1966) A First Course in Stochastic Processes. Academic Press, New York.Google Scholar
[7] Kemeny, J. G. and Snell, J. L. (1960) Finite Markov Chains. Van Nostrand, Princeton, N.J. Google Scholar
[8] Kherts, M. M. (1968) Entropy of languages generated by automated or context-free grammars with a single-value detection. Nauchno-Tekhnicheskaia Informatsia Series 2, 29–34.Google Scholar
[9] Li, T. J. and Fu, K. S. (1969) Automata games, stochastic automata and formal languages. TR-EE 69–1. School of Electrical Engineering, Purdue University, Lafayette, Indiana.Google Scholar
[10] Peizer, D. B. and Olmsted, D. L. (1969) Modules of grammar acquisition. Language 45, 60–96.Google Scholar
[11] Rudin, W. (1953) Principles of Mathematical Analysis. McGraw-Hill, New York.Google Scholar