On Regular Expression Proof Complexity of Salomaa’s Axiom System $$F_1$$

Simon Beier,Markus Holzer

Taming the Infinities of Concurrency Lecture Notes in Computer Science(2024)

引用 0|浏览0
暂无评分
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要