Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Paper
Frequency of decomposability among machines with a large number of states
Abstract
In a universe of machines with n labeled states and p labeled inputs, it is shown that almost all machines have series-parallel decomposition if n and p approach infinity in such a way that pn1/2e-n→0. Also, almost all machines have no series-parallel decomposition if n and p approach infinity in such a way that pn1/6e-n→∞. © 1968 Academic Press Inc.
Related
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence