Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 1 views

    Assign

    Uploaded by

    Sameer Najam
    assignment

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd

    Assign

    Uploaded by

    Sameer Najam
    1 views2 pages
    assignment

    Original Title

    assign

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    assignment

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    1 views2 pages

    Assign

    Uploaded by

    Sameer Najam
    assignment

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    You are on page 1of 2

    ASIGNMENT QUES NO.

    BRANCH: CS 3rd YEAR (B)


    SUBJECT: TAFL

    Q1. Write regular expression corresponding to the following languages in {O, I} *.


    (a) The language of all strings in which every 0 is followed immediately by 11.
    (011+1)*
    (b) The language of all strings that has at most one pair of consecutive l's.
    (0+10)* 11(0+10)*
    Q2. Transform the following Mealy machine into equivalent Moore machine .

    Q3. Obtain regular expression for the language accepted by following automata:

    Q4. Construct a moore machine that determine whether an input strings contain an even or odd
    number of 1’s. the machine should give 1as output if an even number of 1’s are in the string and 0
    otherwise.
    Q5. Discuss the conversion of moore to mealy machine with the help of an example.
    Q6. Draw a Moore or Mealy machine that generates output 'Yes' when accepts a set of strings from
    (0+1)* terminating in last two same symbols.
    Q7. Prove or disprove the following for regular expressions r, s and t
    (1.) (r + s)* = r* + s*
    (ii) s(rs+s)* r= rr*s(rr*s)*
    Q8. Write regular expression for the following language over the alphabet {O, 1} -
    "The set of all strings not containing 101 as a substring." 0*(1+000*)*0*
    Q9. Differentiate between Moore machine and Mealy machine by taking suitable example.
    Q10. Give English description of the language of the following regular expression.
    (0*1*)* 000 (0+1)*
    Q12. Give the English description of the language of the following regular expression.
    (1+ €) (00*1)*0*
    Q13. Write the regular expression for the following language.
    (a) A set of string of 0’s and 1’s with at most one pair of consecutive 1’s.
    (b) Set of all string of 0’s and 1’s such that every pair of adjacent 0’s appear before any pair of
    adjacent 1’s.
    Q14. Prove or disprove the following statement about regular expression.
    (a) (R+S)* = R* + S*
    (b) (RS+R)*RS = (RR*S)*
    Q15. Example with example the algebraic laws for regular expression.
    Q16. Prove, if L is the regular language over the alphabet ∑, then L¯ = ∑*- L is also a regular language.
    Q17. The intersection of two regular languages is regular.
    Q18. Let ∑= {a,b}. For each of the following language over ∑, find the regular expression representing
    it.
    (a) All string that exactly contains one ‘a’.
    (b) All string beginning with ‘ab’.
    (c) All string that contain either the substring ‘aaa’ or ‘bbb’.
    Q19. What is Moore Machine? Change the given Moore machine into Mealy machine :-

    Q20. Find out regular expression of the given diagram.

    Q21. Write regular expression for the following language over the alphabet {0,1}.
    (a) The set of all string in which every pair of adjacent 0’s appears before any pairs of
    adjacent 1’s.
    (b) The set of all string not containing mod 0 as sub string.

    You might also like