ABSTRACTS from other ACM Publications.
Uloženo v:
| Název: | ABSTRACTS from other ACM Publications. |
|---|---|
| Zdroj: | Communications of the ACM; Jul1982, Vol. 25 Issue 7, p487-492, 6p |
| Témata: | SEQUENTIAL machine theory, REDUCED instruction set computers, MICROELECTRONICS, INTEGRATED circuits |
| Reviews & Products: | COMMUNICATIONS of the ACM (Periodical) |
| Abstrakt: | This article presents abstracts published in the July issue of the journal "Communications of the ACM." Some of them are as follows: "The Compilation of Regular Expressions into Integrated Circuits," by Robert W. Floyd and Jeffrey D. Ullman. The design of integrated circuits to implement arbitrary regular expressions is considered. In general, a regular expression with n operands may be converted into a nondeterministic finite automaton with at most n states and n transitions. Instead of converting the nondeterministic device to a deterministic one, two ways of implementing the nondeterministic device directly are proposed. One approach is to produce a programmable logic array (PLA) of approximate dimensions n rows and 2n columns by representing the states of the nondeterministic finite automaton directly by columns. "Linear-Time Computability of Combinatorial Problems on Series-Parallel Graphs," by K. Takamizawa, T. Nishizeki, and N. Saito. A series-parallel graph can be constructed from a certain graph by recursively applying series and parallel connections. The class of such graphs, which is a well-known model of series-parallel electrical networks, is a subclass of planar graphs. |
| Databáze: | Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Buďte první, kdo okomentuje tento záznam!