LOWER BOUNDS ON THE AREA OF FINITE-STATE MACHINES

被引：0

作者：

FOSTER, MJ ^{[1
]}

GREENBERG, RI ^{[1
]}

机构：

[1] MIT,COMP SCI LAB,CAMBRIDGE,MA 02139

来源：

关键词：

D O I：

10.1016/0020-0190(89)90165-8

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：1 / 7

页数：7

共 8 条

[1] Brent R. P., 1982, Microelectronics '82. A National Conference on Microelectronics, P52
[2] ON THE AREA OF BINARY-TREE LAYOUTS
BRENT, RP
KUNG, HT
[J]. INFORMATION PROCESSING LETTERS, 1980, 11 (01) : 46 - 48
[3] DEVIDAS S, 1987, ICCAD87, P16
[4] THE COMPILATION OF REGULAR EXPRESSIONS INTO INTEGRATED-CIRCUITS
FLOYD, RW
ULLMAN, JD
[J]. JOURNAL OF THE ACM, 1982, 29 (03) : 603 - 622
[5] Foster M. J., 1986, VLSI electronics. Microstructure science. Vol.14. VLSI design, P139
[6] TIGHT CHIP AREA LOWER BOUNDS FOR STRING MATCHING
SYKORA, O
VRTO, I
[J]. INFORMATION PROCESSING LETTERS, 1987, 26 (03) : 117 - 119
[7] Thompson C. D., 1980, THESIS CARNEGIE MELL
[8] TRICKEY HW, 1982, IEEE T COMPUT, V31, P514, DOI 10.1109/TC.1982.1676033