Quotients of Context-Free Languages

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Quotients of Context-Free Languages

Full text

Pdf (311 KB)

Source

Journal of the ACM (JACM) archive
Volume 10 , Issue 4 (October 1963) table of contents

Pages: 487 - 492

Year of Publication: 1963

ISSN:0004-5411

Authors

Seymour Ginsburg	System Development Corporation, Santa Monica, California
Edwin H. Spanier	University of California, Los Angeles

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 13, Downloads (12 Months): 57, Citation Count: 4

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/321186.321191 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	BAR-HILLEL, PtRLES, AND SHAMIR. On formal properties of simple phrase structure : grammsJrs. Zvit. Phonetik, Spraehwiss. Kommunikationsforsch. 1, (1961), 143-172.
	2	CHoisKY, N. Three models for the description of language. IRE Trans. IT2 (1956), 113-124.
	3	On certain formal properties of grammars. Inform. Contr. 2 (1959), 137-167.
	4	ELGOT ASND RUTLEDGE, Operations on finite automata. Proc. Second Ann. Syrup. Switching Circuit Theory and Logical Design, Detroit, Oct. 1961, 129-132.
	5	Seymour Ginsburg , H. Gordon Rice, Two Families of Languages Related to ALGOL, Journal of the ACM (JACM), v.9 n.3, p.350-371, July 1962 [doi>10.1145/321127.321132]
	6	Seymour Ginsburg , G. F. Rose, Operations Which Preserve Definability in Languages, Journal of the ACM (JACM), v.10 n.2, p.175-195, April 1963 [doi>10.1145/321160.321167]
	7	Seymour Ginsburg , Gene F. Rose, Some Recursively Unsolvable Problems in ALGOL-Like Languages, Journal of the ACM (JACM), v.10 n.1, p.29-47, Jan. 1963 [doi>10.1145/321150.321153]
	8	KLEENE, S.C. Representation of events in nerve nets and finite automata. Automata Studies, Ann. Math. Studies, No. 34, Princeton Univ. Press, 1956, 3-41.
	9	POST, E. L. A variant of a recursively unsolvable problem. Bull. Am. Math. Soc. 52, (1946), 264-268.
	10	RABIN AND SCOTT. Finite automata and their decision problems. IBM J. Res. Develop. (1959), 114-125.
	11	SeHINRG, S. Note of the Boolean properties of context free languages. Inform. Contr. 3 (1960), 372-375.
	12	SHAreR, E. On sequential languages. Tech. Report No. 7, Appl. Logic Branch, The Hebrew Univ., Jerusalem, Nov. 1961.

CITED BY 4

	Arnold L. Rosenberg, Real-Time Definable Languages, Journal of the ACM (JACM), v.14 n.4, p.645-662, Oct. 1967
	Bruce W. Arden, The role of programming in a Ph.D. computer science program, Communications of the ACM, v.12 n.1, p.31-37, Jan. 1969
	Seymour Ginsburg , Edwin H. Spanier, Mappings of languages by two-tape devices, Journal of the ACM (JACM), v.12 n.3, p.423-434, July 1965
	Michael Domaratzki, Deletion along trajectories, Theoretical Computer Science, v.320 n.2-3, p.293-313, June 14, 2004