Theory Of Computation Quiz

5 Questions | Total Attempts: 56

SettingsSettingsSettings
Please wait...
Computation Quizzes & Trivia

This is your description.


Questions and Answers
  • 1. 
    States that, for a particular language to be a member of a language class, any sufficiently long string in the language contains a section, or sections, that can be removed, or repeated any number of times, with the resulting string remaining in that language.
    • A. 

      Pumping lemma

    • B. 

      Pumping lema

    • C. 

      Pumping

    • D. 

      Lemma

  • 2. 
    Can be used to determine if a particular language is not in a given language class. However, they cannot be used to determine if a language is in a given class, since satisfying the pumping lemma is a necessary, but not sufficient, condition for class membership.
    • A. 

      Pumping

    • B. 

      Lemmas

    • C. 

      Pumping lemma

    • D. 

      Pumping lemmas

  • 3. 
    This is is a second, stronger pumping lemma for context-free languages?
    • A. 

      Pumping Lemma

    • B. 

      Pumping Argument

    • C. 

      Ogden's lemma

    • D. 

      Lemmas

  • 4. 
    The two most important examples are?
    • A. 

      Pumping lemma for regular languages and the pumping lemma for irregular languages

    • B. 

      Pumping lemma for irregular languages and the pumping lemma for context-free languages

    • C. 

      Pumping lemma for regular languages and the pumping lemma for context-free languages

    • D. 

      Pumping lemma for irregular languages and the pumping lemma for regular languages

  • 5. 
    For every regular language there is a ___________ (FSA) that accepts the language?
    • A. 

      Finite social automation

    • B. 

      Finite scene automation

    • C. 

      Final state automation

    • D. 

      Finite state automation

Back to Top Back to top