Type 4 is not computable
msra（1996）
摘要
We extend a recent result of McKenzie, and show that it is an undecidable
problem to determine if 4 appears in the typeset of a finitely generated,
locally finite variety.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要