This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Polylinear Sequential Circuit Realizations of Finite Automata
March 1968 (vol. 17 no. 3)
pp. 251-259
Abstract?This paper considers the problem of obtaining realizations of synchronous finite automata from their regular expression specifications. A polylinear sequential circuit realization is defined, and it is proven that every synchronous finite automaton has such a realization. A method is developed for the derivation of a polylinear sequential circuit realization of any automaton specified by a regular expression. The method uses a derivative approach and is applied to the reverse of the given regular expression. As a by-product of developing the method, a connection between the state assigmnent problem and regular expressions is established. Another by-product is a simple method for obtaining polylinear sequential circuit realizations of automata specified by flow tables instead of regular expressions.
Index Terms:
Index terms?Connection between the state assignment problem and regular expressions, derivative approach, method for obtaining polylinear sequential circuit realizations, regular expression specifications, synchronous finite automata.
Citation:
H.A. Curtis, "Polylinear Sequential Circuit Realizations of Finite Automata," IEEE Transactions on Computers, vol. 17, no. 3, pp. 251-259, March 1968, doi:10.1109/TC.1968.229095
Usage of this product signifies your acceptance of the Terms of Use.