Complexity Analysis: Transformation Monoids Of Finite Automata
DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015)(2015)
摘要
We examine the computational complexity of some problems from algebraic automata theory and from the field of communication complexity: testing Green's relations (relations that are fundamental in monoid theory), checking the property of a finite monoid to have only Abelian subgroups, and determining the deterministic communication complexity of a regular language. By well-known algebraizations, these problems are closely linked with each other. We show that all of them are PSPACE-complete.
更多查看译文
关键词
Green's relations, Finite monoids, Regular languages, Communication complexity, PSPACE-completeness
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要