Skip to main content
SpringerLink
Log in

On the closure of pattern expressions languages under intersection with regular languages

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

In this paper we address a standing question on pattern expressions (PE), namely whether the family of PE languages is closed under the intersection with regular languages. Since this family is not closed under complement, but is closed under reversal, another natural question has frequently been raised in the recent years, on whether particular languages such as the mirror language and the language of palindromes are PE languages. We give answers to these and other related questions as well, thus providing an insight on their descriptional power.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aho, A.V.: Algorithms for Finding Patterns in Strings. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Algorithms and Complexity, vol. A, pp. 255–300. Elsevier, MIT Press, Amsterdam, New York (1990)

  2. Angluin D.: Finding patterns common to a set of strings. J. Comput. Syst. Sci. 21, 46–62 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  3. Câmpeanu C., Salomaa K., Yu S.: A formal study of practical regular expressions. IJFCS 14(6), 1007–1018 (2003)

    MATH  Google Scholar 

  4. Câmpeanu, C., Santean, N.: Addressing an Open Problem on Regex. Technical Report CS-2007-10, School of Computer Science, The University of Waterloo. http://www.cs.uwaterloo.ca/research/tr/2007/

  5. Câmpeanu C., Yu S.: Pattern expressions and pattern automata. IPL 92, 267–274 (2004)

    Article  Google Scholar 

  6. Dumitrescu, S., Păun, G., Salomaa, A.: Pattern Languages versus Parallel Communicating Grammar Systems. TUCS Report, vol. 42, September 1996

  7. Friedl J.E.F.: Mastering Regular Expressions. O’Reilly & Associates, Inc., Cambridge (1997)

    MATH  Google Scholar 

  8. Hopcroft J.E., Motwani R., Ullman J.D.: Introduction to Automata Theory, Languages, and Computation. Addison Wesley, Reading (2006)

    Google Scholar 

  9. Kari L., Mateescu A., Păun G., Salomaa A.: Multi-pattern languages. Theor. Comp. Sci. 141, 253–268 (1995)

    Article  MATH  Google Scholar 

  10. Kobayashi S., Mitrana V., Păun G., Rozenberg G.: Formal Properties of PA-matching. Theor. Comp. Sci. 262(1-2), 117–131 (2001)

    Article  MATH  Google Scholar 

  11. Lesk, M.E.: Lex—a Lexical Analyzer Generator. Computer Science Technical Report, vol. 39, AT&T Bell Laboratories, Murray Hill (1975)

  12. Martín-Vide C., Mitrana V.: Some Undecidable Problems for Parallel Communicating Finite Automata Systems. Inf. Process. Lett. 77, 239–245 (2001)

    Article  MATH  Google Scholar 

  13. Martín-Vide, C., Mitrana, V.: Remarks on Arbitrary Multiple Pattern Interpretations. Inf. Process. Lett. (in press), available online 24 October (2006)

  14. Mitrana V., Păun G., Rozenberg G., Salomaa A.: Pattern systems. Theor Comp. Sci. 154(2), 183–201 (1996)

    Article  MATH  Google Scholar 

  15. Salomaa A.: Theory of Automata. Pergamon Press, Oxford (1969)

    MATH  Google Scholar 

  16. Salomaa A.: Formal Languages. Academic Press, New York (1973)

    MATH  Google Scholar 

  17. Yu S.: Regular Languages. In: Salomaa, A., Rozenberg, G.(eds) Handbook of Formal Languages, pp. 41–110. Springer, Heidelberg (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and IT, University of Prince Edward Island, Charlotte, Canada

    Cezar Câmpeanu

  2. Department of Computer and Information Sciences, Indiana University South Bend, South Bend, USA

    Nicolae Santean

Authors
  1. Cezar Câmpeanu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicolae Santean
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Cezar Câmpeanu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Câmpeanu, C., Santean, N. On the closure of pattern expressions languages under intersection with regular languages. Acta Informatica 46, 193–207 (2009). https://doi.org/10.1007/s00236-009-0090-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-009-0090-y

Keywords

Search

Navigation