Checking Emptiness of Non-Deterministic Regular Types with Set Operators | Zendy

Lunjin Lu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Checking Emptiness of Non-Deterministic Regular Types with Set Operators

Author(s) -

Lunjin Lu

Publication year - 2008

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2008.04.062

Subject(s) - distributivity , parameterized complexity , set (abstract data type) , emptiness , mathematics , type (biology) , expression (computer science) , tuple , regular expression , discrete mathematics , algorithm , computer science , distributive property , pure mathematics , programming language , ecology , philosophy , theology , biology

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research