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

Couverture
Cornell University, Department of Computer Science, 1973 - 30 pages
1) the equivalence and emptiness problem for regular expressions using only the operators -, $\cup$, ., and $\cap$ are p-complete.

Informations bibliographiques

TitreThe Equivalence Problem for Regular Expressions with Intersection is Not Polynomial in Tape
Volume 161 de Cornell University Ithaca, NY, Department of Computer Science: Technical report
AuteursHarry B. Hunt, Cornell University. Department of Computer Science
ÉditeurCornell University, Department of Computer Science, 1973
Longueur30 pages
  
Exporter la citationBiBTeX EndNote RefMan