skip to main content
article
Free Access

A necessary and sufficient pumping lemma for regular languages

Published:01 July 1978Publication History

Abstract

No abstract available.

References

  1. Kosaraju, S. R. MIT Theory of Computation Problem Book (R. Rivest Ed.)Google ScholarGoogle Scholar
  2. Kosaraju, S. R. private communication.Google ScholarGoogle Scholar
  3. Nerode A. "Linear automaton transformations," Proc. Amer. Math. Soc., 9, 541--544.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. A necessary and sufficient pumping lemma for regular languages
    Index terms have been assigned to the content through auto-classification.

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM SIGACT News
      ACM SIGACT News  Volume 10, Issue 2
      Summer 1978
      24 pages
      ISSN:0163-5700
      DOI:10.1145/990524
      Issue’s Table of Contents

      Copyright © 1978 Author

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 July 1978

      Check for updates

      Qualifiers

      • article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader