ISSN:
1572-9125
Keywords:
Recognition
;
normal
;
programming
;
language
;
algorithm
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract A description is given of a program that with certain restrictions on the defining grammar transforms a description of a regular language given by a set of production-rules written in Backus Normal Form to a description of a recognizing algorithm based on a finite number of internal states.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01966090
Permalink