Finite automata and composite realisations
The theory of finite automata provides a formal approach to the design of sequential circuits, assuming the sequential aspect of the realisation to be in the form of bistables. No formal approach has been developed, however, to take advantage of the various sequential units available in MSI (Medium...
Main Author: | Kidson, D. |
---|---|
Published: |
University of Bath
1980
|
Subjects: | |
Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.259326 |
Similar Items
-
Finite automata, machines and counting problems in bounded arithmetic
by: Riley, M.
Published: (1987) -
Finite primitive permutation groups
by: Soomro, K. D.
Published: (1981) -
Some problems in finite group theory
by: Jackson, D. J.
Published: (1981) -
On the classification of finite rings
by: Chikunji, Chiteng'a John
Published: (1996) -
Algorithms for finite structures
by: Mirza, Shemila
Published: (1999)