Programmable finite automata for VLSIFootnote†

†This work was supported by the Natural Sciences and Engineering Research Council of Canada under grant A-7403

References

• Foster , M.J. and Kung , H.T. 1981 . “ Recognizing regular languages with programmable building blocks ” . In VLSI , Edited by: Gray , J.P. 75 – 84 . New York : Academic Press .
   Google Scholar
• Floyd , R.W. and Ullman , J.D. 1982 . The compilation of regular expressions into integrated circuits . JACM , 29 : 603 – 622 .
   Google Scholar
• Culik A. II Salomaa K. Wood D. VLSI systolic trees as acceptors RAIRO 1983 to appear
   Google Scholar
• Culik , K. II , Gruska , J. and Salomaa , A. 1983 . Systolic automata for VLSI on balanced trees . Acta Informatica , 18 : 335 – 344 .
   Web of Science ®Google Scholar
• Mead , C. and Conway , L. 1980 . Introduction to VLSI Systems , Reading, Mass : Addison-Wesley Publ .
   Google Scholar
• Mukhopadhyay , A. 1979 . Hardware algorithms for nonnumeric computation . IEEE Trans on Computers , C-28 : 384 – 394 .
   Google Scholar
• Starke , P.H. 1969 . Abstrakte Automaten , Berlin : VEB Deutscher Verlag der Wissenschaften .
   Google Scholar
• Culik , K. II and Pachl , J. . Folding and unrolling systolic arrays . Proc. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing . pp. 254 – 261 . Fasc .
   Google Scholar
• Salomaa , A. and Soittola , M. 1978 . Automata-Theoretic Aspects of Formal Power Series , Berlin : Springer-Verlag .
   Google Scholar
• Steinby , M. 1983 . Systolic trees and systolic language recognition by tree automata . Theoretical Computer Science , 22 : 219 – 232 .
   Google Scholar
• Aho , A.V. 1980 . “ Pattern matching in strings ” . In Formal Language Theory , Edited by: Book , R.V. 325 – 348 . New York : Academic Press .
   Google Scholar