Skip Navigation

The Computer Journal 1969 12(2):139-147; doi:10.1093/comjnl/12.2.139
© 1969 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (6)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Wood, D.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The normal form theorem—another proof

D. Wood *

Courant Institute, 251 Mercer Street, New York, USA

An alternative proof of the normal form theorem for context-free languages is given. A series of simple constructions lead to the result. The proof makes use of a practical method of removing left cycles due to Foster.

Received September 1968. revised November 1968.

* Work carried out at the University of Leeds, England

§ Present address: Courant Institute, 251 Mercer Street, New York, New York 10012 U.S.A.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.