Skip to main content
SpringerLink
Log in

An efficient algorithm for finding kleene closure of regular expression matrices

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

An efficient algorithm for finding the Kleene closure of regular expressions matrices or fuzzy regular expression matrices is presented and illustrated by examples. Properties of Kleene closure are also investigated. The results may have useful applications in automata theory, pattern recognition, and pictorial information systems.

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. S. C. Kleene, “Representation of events in nerve nets and finite automata,”Automata Studies (Princeton University Press, Princeton, New Jersey, 1956), pp. 3–41.

    Google Scholar 

  2. D. N. Arden, “Delayed logic and finite state machines,”Theory of Computing Machine Design (University of Michigan Press, Ann Arbor, Michigan, 1960), pp. 1–35.

    Google Scholar 

  3. J. A. Brzozowski, “A survey of regular expressions and their applications,”IRE Trans EC-11,3:324–335 (June 1962).

    Google Scholar 

  4. J. A. Brzozowski and E. J. McCluskey, Jr., “Signal flow graph techniques for sequential circuit state diagrams,”IEEE Trans. EC-12,2:67–76 (April 1963).

    Google Scholar 

  5. J. E. Hopcroft and J. D. Ullman,Formal Languages and Their Relation to Automata (Addison-Wesley, Reading, Mass., 1969).

    Google Scholar 

  6. D. J. Rosenkrantz, “Matrix equations and normal forms for context-free grammars,”J. Comp. Machinery,14(3):501–507 (July 1967).

    Google Scholar 

  7. S. Wrshall, “A theorem on Boolean matrices,”J. ACM,1:11–12 (January 1962).

    Google Scholar 

  8. E. T. Lee and L. A. Zadeh, “Note on fuzzy languages,”Inform. Sci.,1:421–434 (1969).

    Google Scholar 

  9. L. A. Zadeh, “Fuzzy languages and their relation to human and machine intelligence,” Memorandum No. ERL-M302, Electronics Research Laboratory, University of California, Berkeley, California, August 1971.

    Google Scholar 

  10. J. E. Hopcroft and J. D. Ullman,Introduction to Automata Theory, Languages, and Computation (Addison Wesley, Reading, Mass., 1979).

    Google Scholar 

  11. E. T. Lee, “Similarity retrieval techniques,” InPictorial Information Systems, S. K. Chang and K. S. Fu (eds.), (Springer-Verlag, New York, 1980), Chapter 6.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Memphis State University, 38152, Memphis, Tennessee

    Edward T. Lee

Authors
  1. Edward T. Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, E.T. An efficient algorithm for finding kleene closure of regular expression matrices. International Journal of Computer and Information Sciences 11, 409–415 (1982). https://doi.org/10.1007/BF00996818

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00996818

Key words

Search

Navigation