No

Yes , with input alphabet  as ∑*

Yes

A finite automaton accepting matching strings

A regular expression generating both lists

A sequence of indices producing equal strings from two lists

A context-free grammar creating both string sets

Recursive

Regular

Set of palindromes over {a, b}

Set of all strings over {a, b}

Set of strings where a is followed by b

Set of all strings with equal number of a’s and b’s

It always halts

None of the above 

It has finite tape

It cannot be simulated by a computer

Testing if a CFG is ambiguous

Testing if a regular expression equals a DFA

Testing if a DFA is empty

Testing if a DFA accepts a string

Linear Bounded Automaton (LBA)

Regular Language Machine

L={ W | W contains sb }

L= { aⁿbⁿ | n ≥ 0 }

L={ a, b }*

L={ w | w contains bs }

Union

Intersection

Keen closure

Concatenation