Closure properties and languages defined by bilinear automata
作者：
Highlights：
•
摘要
In this paper we define bilinear languages, via cutpoints and bilinear automata, and we obtain a necessary condition for a bilinear language to be regular. We also prove that there exists a bilinear language which is nonstochastic.
论文关键词：
论文评审过程：Received 26 November 1976, Revised 30 November 1977, Available online 3 December 2003.
论文官网地址：https://doi.org/10.1016/0022-0000(78)90017-X
