Lower bounds on the area of finite-state machines

DOI10.1016/0020-0190(89)90165-8zbMath0664.68039OpenAlexW2052247370MaRDI QIDQ1115595

M. J. Foster, Ronald I. Greenberg

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://ecommons.luc.edu/cs_facpubs/95

zbMATH Keywords

lower boundsregular languagescustom VLSIfinite- state machineslayout algorithmsilicon compilers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cites Work

• Tight chip area lower bounds for string matching
• The Compilation of Regular Expressions into Integrated Circuits

This page was built for publication: Lower bounds on the area of finite-state machines