Advertisement

The complexity of the inequivalence problem for regular expressions with intersection

  • Martin Fürer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 85)

Abstract

The nondeterministic lower space bound \(\sqrt n\) of Hunt, for the problem if a regular expression with intersection describes a non-empty language, is improved to the upper bound n. For the general inequivalence problem for regular expressions with intersection the lower bound cn matches the upper bound except for the constant c. And the proof for this tight lower bound is simpler than the proofs for previous bounds. Methods developed in a result about one letter alphabets are extended to get a complete characterization for the problem of deciding if one input-expression describes a given language. The complexity depends only on the property of the given language to be finite, infinite but bounded, or unbounded.

Keywords

Turing Machine Regular Expression Regular Language Letter Alphabet Lower Space 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., J.E. Hopcroft and J.D. Ullman, "The Design and Analysis of Computer Algorithms", Addison-Wesley, Reading, Mass., 1974.Google Scholar
  2. Chandra, A.K. and L.J. Stockmeyer, "Alternation", Proc. 17th Annual IEEE Symposium on Foundations of Comp. Sci., 98–108, 1976.Google Scholar
  3. Fürer, M., "Non-elementary lower bounds in automata theory", (in German), Diss. ETH 6122 (Ph.D. Thesis), Zürich, 1978.Google Scholar
  4. Hopcroft, J.E., W.J. Paul and L.G. Valiant, "On Time Versus Space", Journal of the Association for Computing Machinery 24, 332–337, 1977.Google Scholar
  5. Hunt III, H.B., "The equivalence problem for regular expressions with intersection is not polynomial in tape", Tech. Report TR 73-161, Dept. of Computer Science, Cornell University, 1973.Google Scholar
  6. Hunt III, H.B., D.J. Rosenkrantz and T.G. Szymanski, "On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages", J. of Computer and System Sciences 12, 222–268, 1976.Google Scholar
  7. Kozen, D., "On parallelism in Turing machines", Proc. 17th Annual IEEE Symposium on Foundations of Comp. Sci., 89–97, 1976.Google Scholar
  8. Meyer, A.R. and L.J. Stockmeyer, "The equivalence problem for regular expressions with squaring requires exponential space", Proc. 13th Annual IEEE Symposium on Switching and Automata Theory, 125–129, 1972.Google Scholar
  9. Rangel, J.L. "The Equivalence Problem for Regular Expressions over One Letter is Elementary", 15th Annual Symposium on Switching and Automata Theory, 24–27, 1974.Google Scholar
  10. Sieferas, J.I., M.J. Fischer and A.R. Meyer, "Refinements of the Nondeterministic Time and Space Hierarchies", Proc. 14th Annual IEEE Symposium on Switching and Automata Theory, 130–137, 1973.Google Scholar
  11. Stockmeyer, L.J., "The complexity of decision problems in automata theory and logic". Report TR-133, M.I.T., Project MAC, Cambridge, Mass., 1974.Google Scholar
  12. Stockmeyer, L.J. and A.R. Meyer, "Word Problems Requiring Exponential Time: Preliminary Report", Proc. 5th Annual ACM Symposium on the Theory of Computing, 1–9, 1973.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Martin Fürer
    • 1
  1. 1.Department of Computer ScienceUniversity of EdinburghEdinburghScotland

Personalised recommendations