|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Next-State Equations of Asynchronous Sequential Machines
April 1972 (vol. 21 no. 4)
pp. 397-399
| ASCII Text | x | ||
| Gabriele Saucier, "Next-State Equations of Asynchronous Sequential Machines," IEEE Transactions on Computers, vol. 21, no. 4, pp. 397-399, April, 1972. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1972.5008984, author = {Gabriele Saucier}, title = {Next-State Equations of Asynchronous Sequential Machines}, journal ={IEEE Transactions on Computers}, volume = {21}, number = {4}, issn = {0018-9340}, year = {1972}, pages = {397-399}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1972.5008984}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Next-State Equations of Asynchronous Sequential Machines IS - 4 SN - 0018-9340 SP397 EP399 EPD - 397-399 A1 - Gabriele Saucier, PY - 1972 VL - 21 JA - IEEE Transactions on Computers ER - | |||
A theorem and two applications are given here to solve the problem of selecting state assignments of asynchronous machines. The assignment has to produce a set of simple next-state equations. The proofs use the algebraic structures defined by Hartmanis. A first illustration is given by Liu's encoding; likewise, Tracey's selection theorems are easily found again and placed in a more general context.
Citation:
Gabriele Saucier, "Next-State Equations of Asynchronous Sequential Machines," IEEE Transactions on Computers, vol. 21, no. 4, pp. 397-399, April 1972, doi:10.1109/TC.1972.5008984
Usage of this product signifies your acceptance of the Terms of Use.