Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

5

ENTCS
2008

favoriteEmaildiscussreport

87views more ENTCS 2008»

Checking Emptiness of Non-Deterministic Regular Types with Set Operators

13 years 4 months ago

Checking Emptiness of Non-Deterministic Regular Types with Set Operators

Download www.secs.oakland.edu

An algorithm to decide the emptiness of a regular type expression with set operators given a set of parameterized type definitions is presented. The algorithm generalizes previous work in that tuple distributivity is not assumed and set operators are permitted in type expressions.

Lunjin Lu

Real-time Traffic

ENTCS 2008 | Parameterized Type Definitions | Regular Type Expression | Type Expressions |

claim paper

Related Content

» Improving Precision of Type Analysis Using NonDiscriminative Union

» Linear time membership in a class of regular expressions with interleaving and counting

» Linear Time Membership for a Class of XML Types with Interleaving and Counting

» Computing the graphbased parallel complexity of gene assembly

» DNA Computing Based on Splicing Universality Results

» Sublanguage Engineering In The Fog System

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	ENTCS
Authors	Lunjin Lu

Comments (0)