skip to content
The Compilation of Regular Expressions into Integrated Circuits. Preview this item
ClosePreview this item
Checking...

The Compilation of Regular Expressions into Integrated Circuits.

Author: Robert W Floyd; Jeffrey D Ullman; STANFORD UNIV CA DEPT OF COMPUTER SCIENCE.
Publisher: Ft. Belvoir Defense Technical Information Center APR 1980.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Robert W Floyd; Jeffrey D Ullman; STANFORD UNIV CA DEPT OF COMPUTER SCIENCE.
OCLC Number: 227463743
Description: 3 p.

Abstract:

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).

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/227463743>
library:oclcnum"227463743"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:contributor
schema:datePublished"APR 1980"
schema:datePublished"1980"
schema:description"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)."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/10640625>
schema:inLanguage"en"
schema:name"The Compilation of Regular Expressions into Integrated Circuits."@en
schema:numberOfPages"3"
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.