An Investigation of Equivalent Serialized Forms of Parallel Finite Automata

eBook (PDF), 54 Pages
This item has not been rated yet
Price: $4.41
The equivalence of non-deterministic finite automata, deterministic finite automata, regular expressions, and parallel finite automata with augmented regular expressions is used to relate parallel finite automata to the shuffle operation on regular languages. Our goal is to capitalize on the equivalence of regular expressions and augmented regular expressions to increase parallelization efficiency. We use the existing automated transformation algorithms for the various finite automata listed above to inform a transformation from augmented regular expressions to regular expressions. We then discuss the serialization of augmented regular expressions.
Available in PDF Format

Ratings & Reviews

Log in to review this item
There are no reviews for the current version of this product
There are no reviews for previous versions of this product

Product Details

October 1, 2011
File Format
File Size
473.68 KB
Product ID

Formats for this Ebook

Required Software Any PDF Reader, Apple Preview
Supported Devices Windows PC/PocketPC, Mac OS, Linux OS, Apple iPhone/iPod Touch... (See More)
# of Devices Unlimited
Flowing Text / Pages Pages
Printable? Yes
Report This Content to Lulu >

Moderation of Questionable Content

Thank you for your interest in helping us moderate questionable content on Lulu. If you need assistance with an order or the publishing process, please contact our support team directly.

How does this content violate the Lulu Membership Agreement?


Listed In