谷歌浏览器插件
订阅小程序
在清言上使用

The Frobenius and Factor Universality Problems of the Kleene Star of a Finite Set of Words.

Journal of the Association for Computing Machinery(2021)

引用 23|浏览5
暂无评分
关键词
Cofinite language,complete set,completable word,factor universality,finite list of words,incompletable word,Frobenius monoid,Kleene star,mortality,Restivo's conjecture,universality
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要