Rational Weighted Tree Languages with Storage and the Kleene-Goldstine Theorem.

ALGEBRAIC INFORMATICS, CAI 2019(2019)

引用 2|浏览8
暂无评分
摘要
We introduce rational weighted tree languages with storage over commutative, complete semirings and show a Kleene-Goldstine theorem.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要