On vector languages
作者：
Highlights：
•
摘要
The family of vector languages properly contains all context-free languages. For vector languages the emptiness and finiteness problems are proved to be decidable. The Parikh mapping of a vector language is shown to be semilinear.
论文关键词：
论文评审过程：Received 2 January 1973, Revised 3 July 1973, Available online 31 December 2007.
论文官网地址：https://doi.org/10.1016/S0022-0000(74)80053-X
