The Halting Problem for Probabilistic Context-Free Generators

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The Halting Problem for Probabilistic Context-Free Generators

Full text

Pdf (186 KB)

Source

Journal of the ACM (JACM) archive
Volume 19 , Issue 3 (July 1972) table of contents

Pages: 396 - 399

Year of Publication: 1972

ISSN:0004-5411

Author

Clarence A. Ellis

National Chiao Tung University, Department of Computer Science, Hsinchu, Taiwan, Republic of China

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 19, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321707.321709 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	ELLIS, C.A. Probabilistic languages and automata. Ph.D. Th., U. of Illinois, Urbana, Ill., Sept. 1969.
	2	Sheila A. Greibach, A New Normal-Form Theorem for Context-Free Phrase Structure Grammars, Journal of the ACM (JACM), v.12 n.1, p.42-52, Jan. 1965 [doi>10.1145/321250.321254]
	3	Larry Irwin, Implementing phrase-structure productions in PL/I, Communications of the ACM, v.10 n.7, p.424, July 1967 [doi>10.1145/363427.363445]
	4	Ira Pohl, Phas-structure productions in PL/I: Phas-structure productions in PL/I0, Communications of the ACM, v.10 n.12, p.757, Dec. 1967 [doi>10.1145/363848.363850]
	5	ZADEH, A. Fuzzy sets. Informalion art(1 Control 8, 3 (July 1965), 338 353.