References
1. Bennetts, R.C., J.L. Washington, and D.W. Lewin (1972). “A Computer Algorithm for State Table Reductions”, IERE Radio and Electron. Engg., Vol. 42, November, pp. 513–520.
2. Booth, T.L. (1967). Sequential Machines and Automata Theory. New York: John Wiley.
3. Hill, P.J. and G.R. Peterson (1981). Introduction to Switching Theory and Logical Design. New York: Wiley.
4. Holdsworth, B. (1987). Digital Logic Design. New Delhi: Butherworth & Co.
5. Jain, R.P. (1984). Modern Digital Electronics. New Delhi: TMH.
6. Kohavi, Z. (1978). Switching and Finite Automata Theory. New Delhi: TMH.
7. Luccio, F. (1969). “Extending the Definition of Prime Compatibility Classes of States in Incomplete Sequential Machine Reduction”, IEEE Trans. Compu. ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access