The Equivalence Problem for Regular Expressions with Intersection is Not Polynomial in Tape
dc.contributor.author | Hunt, Harry B. III | en_US |
dc.date.accessioned | 2007-04-19T19:02:58Z | |
dc.date.available | 2007-04-19T19:02:58Z | |
dc.date.issued | 1973-03 | en_US |
dc.description.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 -, $\cup$, ., and $\cap$ are p-complete. 2) the emptiness problem for regular expressions using the operators -, $\cup$, ., $\cap$ and * is tape-hard; 3) the emptiness problem for regular expressions using the operators -, $\cup$, ., $\cap$ and 2 is tape-hard; 4) the equivalence problem for regular expressions using the operators -, $\cup$, ., $\cap$ and * is not polynomial in tape; and 5) the equivalence problem for regular expressions using the operators -, $\cup$, ., $\cap$ and 2 requires exponential time. | en_US |
dc.format.extent | 1776148 bytes | |
dc.format.extent | 561648 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | application/postscript | |
dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR73-161 | en_US |
dc.identifier.uri | https://hdl.handle.net/1813/6010 | |
dc.language.iso | en_US | en_US |
dc.publisher | Cornell University | en_US |
dc.subject | computer science | en_US |
dc.subject | technical report | en_US |
dc.title | The Equivalence Problem for Regular Expressions with Intersection is Not Polynomial in Tape | en_US |
dc.type | technical report | en_US |