COS3701 Theoretical Computer Science III (COS3701)

questions with well outlined answers for exam preparations. compiled from past years

COS3701 Assignment 4 Semester 2 2022. Σ = {a, b}. EVEN-EVEN is defined on page 236 of Cohen: EVEN-EVEN = all strings x with an even number of as and an even number of bs. Note that TL101 refers to ODDPALINDROME but the language we are actually interested in is EVEN-EVEN. A TM that accepts this language is illustrated in Figure 1. This TM has essentially four states State 1 This represents the case where an odd number of as and an even number of bs have been read (OE). State 2 This repre...

COS3701 Assignment 4 Semester 2 2022 COS3701 - Theoretical Computer Science III Σ = {a, b}. EVEN-EVEN is defined on page 236 of Cohen: EVEN-EVEN = all strings x with an even number of as and an even number of bs. Note that TL101 refers to ODDPALINDROME but the language we are actually interested in is EVEN-EVEN. A TM that accepts this language is illustrated in Figure 1. This TM has essentially four states State 1 This represents the case where an odd number of as and an even number of b...

COS3701 Assignment 4 Semester 2 2022. Σ = {a, b}. EVEN-EVEN is defined on page 236 of Cohen: EVEN-EVEN = all strings x with an even number of as and an even number of bs. Note that TL101 refers to ODDPALINDROME but the language we are actually interested in is EVEN-EVEN. A TM that accepts this language is illustrated in Figure 1. This TM has essentially four states State 1 This represents the case where an odd number of as and an even number of bs have been read (OE). State 2 This repre...

Theoretical Computer Science III (COS3701

COS3701 - Notes (Summary) S - The study-notes marketplace Context Free Language (CFL) CFL is a language generated by some Context Free Grammer(CFG) CFGs CFG formal definition: Nonterminals are capital letters and terminals (since they can terminate, i.e end) are small values. Example: So the general formulae is