Skip to main content
SpringerLink
Log in

Intersection of Regular Languages and Star Hierarchy

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2380))

Included in the following conference series:

Abstract

In this paper we consider the intersection-nonemptiness problem for languages given by regular expression without binary +. We prove that for regular expressions of star height 2 this problem is PSPACE-complete and it is NP-complete for regular expressions of star height at most 1.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.-C. Birget, S. Margolis, J. Meakin, P. Weil, P SPACE-completness of Certain Algorithm Problems On The Subgroups of Free Groups, Proc. LNCS. Springer-Verlag, ICALP’94.

    Google Scholar 

  2. J.-C. Birget, S. Margolis, J. Meakin, P. Weil, PSPACE-complete Problems for subgroups of free groups and inverse automata, Theoretical Computer Science 242(1–2), 247–281, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  3. S. Cho, D. Huynh, Finite-automaton aperiodicity is PSPACE-complete, Theoretical Computer Science 88 (1991) 411–424.

    Article  MathSciNet  Google Scholar 

  4. V. Diekert, J.M. Robson, On Quadric Word Equations, STACS’99, Proc. LNCS. Springer-Verlag, Berlin, 1999.

    Google Scholar 

  5. F. Dejean and M.P. Schützenberger, On Question of Eggan, Information and Control 9, 1966.

    Google Scholar 

  6. L.C. Eggan, Transition Graphs and Star Height of Regular Events, Michigan Math. J. 10, 1963.

    Google Scholar 

  7. Y. Gurevich, A. Voronkov, Monadic Simultaneous Rigid E-Unification and Related Problems Proc. LNCS. Springer-Verlag, ICALP’97.

    Google Scholar 

  8. J. Hopcroft, J. Ullman, Introduction to Automata Theory, Formal Languages and Computation Addison-Wesley. 1979.

    Google Scholar 

  9. T. Jiang, B. Ravikumar A Note On The Space Complexity of Some Decision Problems for Finite Automata, Information Processing Letters, 40(1991) 25–31.

    Article  MATH  MathSciNet  Google Scholar 

  10. D. Kozen, Lower Bounds For Natural Proof Systems, Proc. 18-th Symp. Fun-dations of Comp. Sci. 1977.

    Google Scholar 

  11. K.-J. Lange, P. Rossmanith, The Emptiness Problem for Intersection of Regular Languages, Conference on Mathematical Foundations of Computer Science,] Proc. LNCS. Springer-Verlag, 1992.

    Google Scholar 

  12. C.H. Papadimitriou, Computational Complexity, Adison-Wesley Publ. 1994.

    Google Scholar 

  13. K.U. Schultz, Makanin’s Algorithm for Word Equations: two improvements and a generalizations, IWWERT’90, LNCS 572, 85–150, 1992.

    Google Scholar 

  14. S. Yu, Regular Language in G.Rozenber A. Salomaa Eds. Handbook of Formal Language, vol.1, Springer-Verlag Berlin Heidelberg, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Wroclaw, Przesmyckiego 20, 51151, Wroclaw, Poland

    Sebastian Bala

Authors
  1. Sebastian Bala
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Theoretical Computer Science, ETH Zentrum, ETH Zürich, 8092, Zürich, Switzerland

    Peter Widmayer  & Stephan Eidenbenz  & 

  2. Department of Languages and Sciences of the Computation E.T.S. de Ingeniería Informática, University of Málaga, Campus de Teatinos, 29071, Málaga, Spain

    Francisco Triguero , Rafael Morales  & Ricardo Conejo ,  & 

  3. School of Cognitive and Computing Sciences, University of Sussex, Falmer, Brighton, BN1 9QN, UK

    Matthew Hennessy

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bala, S. (2002). Intersection of Regular Languages and Star Hierarchy. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-45465-9_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43864-9

  • Online ISBN: 978-3-540-45465-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation