Proof of a conjecture by A.W. Burks and H.Wang: Some relations between net cycles and states cycles
dc.contributor.author | Zeigler, Bernard P. | en_US |
dc.date.accessioned | 2006-04-17T16:45:47Z | |
dc.date.available | 2006-04-17T16:45:47Z | |
dc.date.issued | 1972-10 | en_US |
dc.identifier.citation | Zeigler, Bernard P. (1972/10)."Proof of a conjecture by A.W. Burks and H.Wang: Some relations between net cycles and states cycles." Information and Control 21(3): 185-195. <http://hdl.handle.net/2027.42/34023> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B7MFM-4DX4DDV-29/2/9a175a15efe775093ef0e158631149db | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/34023 | |
dc.description.abstract | In a foundational paper on the theory of automata A. W. Burks and H. Wang (1957) conjectured that a certain complexity measure involving the size of the strong components of a logical net formed a hierarchy for net behavior. This conjecture was established by Rhodes and Krohn. In this paper a strengthened version of the conjecture is proved by establishing that any logical net can be interpreted as a series-parallel composition of nets associated with its strong components. Some properties of the periodic behavior of machines, shown to be preserved under simulation and composition operations, are used to complete the proof. The relationship of this approach to algebraic proofs of series-parallel irreducibility is discussed. | en_US |
dc.format.extent | 504121 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | Proof of a conjecture by A.W. Burks and H.Wang: Some relations between net cycles and states cycles | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Science (General) | en_US |
dc.subject.hlbsecondlevel | Information and Library Science | en_US |
dc.subject.hlbsecondlevel | Computer Science | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.subject.hlbtoplevel | Social Sciences | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Computer and Communication Sciences, Logic of Computers Group, University of Michigan, Ann Arbor, Michigan 48104, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/34023/1/0000299.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/S0019-9958(72)80001-9 | en_US |
dc.identifier.source | Information and Control | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.