Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics
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.
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Nimrod Megiddo
Journal of Symbolic Computation
Imran Nasim, Michael E. Henderson
Mathematics