L = {aⁿb²ⁿ : n ≥ 0}

L = {a²ⁿbⁿ : n >

0}

L = {aⁿb²ⁿ : n >

0}

L = {a²ⁿbⁿ : n ≥ 0}

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

d

c

b

a

Closure,

Distributivity, Identity, Inverse

Closure,

Commutativity, Identity, Inverse

Closure,

Associativity, Commutativity, Distributivity

Closure,

Associativity, Identity, Inverse

G

is infinite

None

of the above

G

is always non-Abelian

G

is cyclic and Abelian

3

0

1

2

AND

operation

Integer

addition

Subtraction

XOR operation