The Equivalence Problem for Regular Expressions with Intersection is Not Polynomial in Tape

Other Titles
Abstract

We investigate the complexity of several predicates on regular sets. In particular, we show: 1) the equivalence and emptiness problem for regular expressions using only the operators -, , ., and are p-complete. 2) the emptiness problem for regular expressions using the operators -, , ., and * is tape-hard; 3) the emptiness problem for regular expressions using the operators -, , ., and 2 is tape-hard; 4) the equivalence problem for regular expressions using the operators -, , ., and * is not polynomial in tape; and 5) the equivalence problem for regular expressions using the operators -, , ., and 2 requires exponential time.

Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1973-03
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR73-161
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report
Accessibility Feature
Accessibility Hazard
Accessibility Summary
Link(s) to Catalog Record