Scribd Logo
Upload

Welcome to Scribd!

  • Y1996p2q8 PDF

    Uploaded by

    deepakk
    12 views1 page
    The document discusses regular languages and finite automata. It asks three questions: 1) whether the set of strings of odd/even length in a regular language is also regular, 2) if the set of palindrome strings in a regular language is necessarily regular, and 3) whether there exists regular languages that are subsets of or supersets of the non-regular palindrome language. The document provides space for explanations and examples in answers to each question.

    Original Description:

    Original Title

    y1996p2q8.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses regular languages and finite automata. It asks three questions: 1) whether the set of strings of odd/even length in a regular language is also regular, 2) if the set of palindrome strings in a regular language is necessarily regular, and 3) whether there exists regular languages that are subsets of or supersets of the non-regular palindrome language. The document provides space for explanations and examples in answers to each question.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    12 views1 page

    Y1996p2q8 PDF

    Uploaded by

    deepakk
    The document discusses regular languages and finite automata. It asks three questions: 1) whether the set of strings of odd/even length in a regular language is also regular, 2) if the set of palindrome strings in a regular language is necessarily regular, and 3) whether there exists regular languages that are subsets of or supersets of the non-regular palindrome language. The document provides space for explanations and examples in answers to each question.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    1996 Paper 2 Question 8

    Regular Languages and Finite Automata

    Show that if L is a regular language then the set of strings in L of odd length is
    also a regular language. Is the same true of strings of even length? Justify your
    answer. [8 marks]

    If L is regular language let L0 be the set of strings in L that are palindromes. Is


    is possible that L0 is regular? Will L0 necessarily be regular? Explain your answer
    with suitable examples and proofs. [6 marks]

    It is known that the language Pal consisting of all palindromes is not regular. If
    possible find a regular language L such that L is a subset of Pal, or if this is not
    possible explain why. Similarly either find a regular language L0 so that Pal is a
    subset of L0 , or again explain why this can not be done. [6 marks]

    You might also like