Programmable finite automata for VLSI†
- 1 January 1983
- journal article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 14 (3-4) , 259-275
- https://doi.org/10.1080/00207168308803390
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Systolic trees and systolic language recognition by tree automataTheoretical Computer Science, 1983
- Systolic automata for VLSI on balanced treesActa Informatica, 1983
- The Compilation of Regular Expressions into Integrated CircuitsJournal of the ACM, 1982
- Folding and unrolling systolic arrays (Preliminary Version)Published by Association for Computing Machinery (ACM) ,1982
- Pattern Matching in StringsPublished by Elsevier ,1980
- Hardware Algorithms for Nonnumeric ComputationIEEE Transactions on Computers, 1979
- Automata-Theoretic Aspects of Formal Power SeriesPublished by Springer Nature ,1978