Complexity of Regular Functions

LATA(2019)

引用 14|浏览32
暂无评分
摘要
We give complexity bounds for various classes of functions computed by cost register automata.
更多
查看译文
关键词
Computational complexity,Transducers,Weightedautomata
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要