d

c

b

a

Every

non-deterministic PDA can be converted to an equivalent deterministic PDA

Complement of every context-free language

is recursive

There is a unique

minimal DFA for every regular language

Every NFA can be converted to an equivalent

PDA

x is a string such that it ends with ‘01’

x is a string such that it has odd 1’s and even 0’s

x is a string such that it has starting and ending characters as 1

x is a string such that it ends with ‘101’

0*(10*10*)*10*

(0*10*10* )*0*1

((0+1)*1(0+1)*1)*10*

10*(0*10*10*)*

2 or more

0

1

1 or more

Turing

Machine

Moore

Machine

Finite Automata

Mealy

Machine

L

= { aⁿbᵐcᵐdⁿ | n, m ≥ 1 }

L

= { aⁿbⁿcᵐdᵐ | n, m ≥ 1 }

L = { aⁿbⁿcⁿ|n,m ≥ 1}

L

= { aⁿb

{a, f1, f2, f3}

{f1, f2, f3}

{f1, f2}

None of the mentioned

10

11

12

7