Scribd Logo
Upload

Welcome to Scribd!

  • Acd

    Uploaded by

    Kumar Saikrishna
    4 views1 page
    What is finite automata?give ex? 2.find re for given dfa as shown 3.nfa with E-transitions to nfa withoutE-transition 4.find out re to language ofall strings over sigma=1,0 containing xactly 2 zer oes 5.show dat CFG string of terminlas that hav equal no of a's and b's?

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    What is finite automata?give ex? 2.find re for given dfa as shown 3.nfa with E-transitions to nfa withoutE-transition 4.find out re to language ofall strings over sigma=1,0 containing xactly 2 zer oes 5.show dat CFG string of terminlas that hav equal no of a's and b's?

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views1 page

    Acd

    Uploaded by

    Kumar Saikrishna
    What is finite automata?give ex? 2.find re for given dfa as shown 3.nfa with E-transitions to nfa withoutE-transition 4.find out re to language ofall strings over sigma=1,0 containing xactly 2 zer oes 5.show dat CFG string of terminlas that hav equal no of a's and b's?

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    1.what is finite automata?give ex? 2.find re for given dfa as shown 3.nfa with E-transitions to nfa withoutE-transition 4.

    find out re to language ofall strings over sigma={1,0} containing xactly 2 zer oes 5.construct dfa from nfa 6.show dat CFG string of terminlas that hav equal no of a's and b's? 7.when 2 re are said 2 be equivalent?give exampl? 8.write closure properties of regular seets? 9.design a dfathat acepts the languageover sigma={0,1,2}where decimal equivalent oflanguage is divided by 3? 10.find out E-closure of a and c for finite automata as shown below?

    You might also like