๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient algorithm for finding kleene closure of regular expression matrices

โœ Scribed by Edward T. Lee

Publisher
Springer
Year
1982
Tongue
English
Weight
247 KB
Volume
11
Category
Article
ISSN
1573-7640

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient algorithms for finding maximum
Efficient algorithms for finding maximum cliques of an overlap graph
โœ Sumio Masuda; Kazuo Nakajima; Toshinobu Kashiwabara; Toshio Fujisawa ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 728 KB

Let F = { I , , 12,. . . , Z,,} be a finite family of closed intervals on the real line. Two intervals 4 and Ik in F are said to overlap each other if they intersect but neither one of them contains the other. A graph G = (V, E) is called an overlap graph for F if there is a one-to-one correspondenc

An algorithm to find formulae and values
An algorithm to find formulae and values of minors for Hadamard matrices: II
โœ C. Koukouvinos; E. Lappas; M. Mitrouli; Jennifer Seberry ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 125 KB

An algorithm computing the (nj) ร— (nj), j = 1, 2, . . . minors of Hadamard matrices of order n is presented. Its implementation is analytically described step by step for several values of n and j . For j = 7 the values of minors are computed for the first time. A formulae estimating all the values