Robert W Floyd; Jeffrey D Ullman; STANFORD UNIV CA DEPT OF COMPUTER SCIENCE.
We consider the design of integrated circuits to implement arbitrary regular expressions. In general, we may use the McNaughton-Yamada algorithm to convert a regular expression of length n into a nondeterministic finite automation with at most 2n states and 4n transitions. Instead of converting the nondeterministic device to a deterministic one, we propose two ways of implementing the nondeterministic device directly. First, we could produce a PLA (programmable logic array) of approximate dimensions 4n x 4n by representing the states directly by columns, rather than coding the states in binary. This approach, while theoretically suboptimal, makes use of carefully developed technology and, because of the care with which PLA implementation has been done, may be the preferred technique in many real situations. Another approach is to use the hierarchical structure of the automation produced from the regular expression to guide a hierarchical layout of the circuit. This method produces a circuit 0(square root of n) on a side and is, to within a constant factor, the best that can be done in general. (Author).
- Electrical and Electronic Equipment.
- Theoretical Mathematics.
- Solid State Physics.
- Computer programming.
- Integrated circuits.
- Logic circuits.
- Circuit analysis.
- Equivalent circuits.
- Square roots.
- McNaughton Yamada algorithm
- PLA(Programmable Logic Arrays)
- Circuit layouts
- NFA(Nondeterministic Finite Automation)
- Regular expressions
- Actual to logical interpreters
- Unary counters