账务
高级检索
首页 > 报刊文摘 > Construction of recognition devices for regular languages from their Backus Normal Form definition

Construction of recognition devices for regular languages from their Backus Normal Form definition

查看文章

AbstractA 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.



出版机构:Springer Netherlands刊物名称:Bit Numerical Mathematics
出版时间:1966
ISSN:0006-3835
相似文献
-