节点文献
A REMEDY FOR S. EILENBERG’S LIMIT THEOREM
【摘要】 <正> The notations in this paper are adopted from [1] and [2] unless otherwise stated. Let K be a semiring. A language is called K-regular-∑-language if it can be recognized by a finite K-∑-automaton. If is a K-regular-a-language,
- 【文献出处】 A Monthly Journal of Science ,科学通报(英文版) , 编辑部邮箱 ,1983年07期
- 【下载频次】5