|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Cascade synthesis of finite-state machines
Ann Arbor, MI
October 06-October 08
| ASCII Text | x | ||
| H. P. Zeiger, "Cascade synthesis of finite-state machines," Foundations of Computer Science, IEEE Annual Symposium on, pp. 45-51, 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965), 1965. | |||
| BibTex | x | ||
| @article{ 10.1109/FOCS.1965.4, author = {H. P. Zeiger}, title = {Cascade synthesis of finite-state machines}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1965}, isbn = {}, pages = {45-51}, doi = {http://doi.ieeecomputersociety.org/10.1109/FOCS.1965.4}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Cascade synthesis of finite-state machines SN - SP45 EP51 A1 - H. P. Zeiger, PY - 1965 VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.1965.4
One can construct any finite-state machine as a cascade interconnection of machines whose inputs either permute the states or reset them all to one state. Each permutation group needed in the construction is a homomorphic image of a group generated by the action of a set of input sequences on a state subset of the original machine. Proofs of these facts will be given and their application to the Rhodes-Krohn theory described.
Citation:
H. P. Zeiger, "Cascade synthesis of finite-state machines," focs, pp.45-51, 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965), 1965
Usage of this product signifies your acceptance of the Terms of Use.