The Compilation of Regular Expressions into Integrated Circuits

DOI10.1145/322326.322327zbMath0485.68047OpenAlexW2000667158MaRDI QIDQ3945588

Jeffrey D. Ullman, Robert W. Floyd

Publication date: 1982

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322326.322327

zbMATH Keywords

nondeterministic finite automatonprogrammable logic arrayhierarchical layoutcircuit areadesign of integrated circuits

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Algorithms for the compilation of regular expressions into PLAs ⋮ Lower bounds on the area of finite-state machines ⋮ AUTOMATE, a computing package for automata and finite semigroups ⋮ Programmable finite automata for VLSI† ⋮ Asymptotical behaviour of some non-uniform measures ⋮ Sorting and doubling techniques for set partitioning and automata minimization problems ⋮ A framework for solving VLSI graph layout problems

This page was built for publication: The Compilation of Regular Expressions into Integrated Circuits