rejected

goes into loop forever

Queue

List

Tree

Stack

I is true

Both are true

Both are false

II is true

BADCE

ACDBE

BACDE

ABCDE

Every regular language can be recognized by a non-deterministic finite automaton (NFA)

Every regular language can be recognized by a deterministic finite automaton (DFA)

All the mentioned

Every DFA can be converted to an equivalent NFA

uv^n w ∈ L for all n ≥ 0

uv^n w ∈ L for all n ≥ 2

uv^n w ∈ L for all n ≥ 1

uv^n w ∈ L for all n ≥ -1

Complement

Union

All of the above

Intersection

The PDA moves to state p, reads symbol a, and pushes string α onto the stack

The PDA moves to state p, reads symbol a, and pops string α from the stack

The PDA moves to state q, reads symbol a, and pushes string α onto the stack

The PDA moves to state q, reads symbol a, and pops string α from the stack

To store a sequence of symbols for processing

To store states

To store intermediate computations

To store input symbols