Notices
Results 1 to 1 of 1

Thread: Pumping lemma and minimization of Finite Automata

  1. #1 Pumping lemma and minimization of Finite Automata 
    New Member
    Join Date
    Oct 2009
    Posts
    1
    I have a problem with this question.

    A language Z splits a language S if Z intersect S and ZBAR intersect S are infinite.
    How to show that every infinite regular language S there exists a reglar language Z that splits S.


    Reply With Quote  
     

  2.  
     

Bookmarks
Bookmarks
Posting Permissions
  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •