Affiliation:
1. Carnegie-Mellon University, Department of Computer Science, Pittsburgh, Pennsylvania
Abstract
It is shown that a short proof of the equivalence of star-free and group-free regular events is possible if one is willing to appeal to the Krohn-Rhodes machine decomposition theorem.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference6 articles.
1. Finite automt ad their decision problems;RABIN M. O.;IBM Develop.,1959
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献