Toc question

Question

Consider the two given languages :

• A={x:x is an integer and divisible by 2)  
• B ={2x:x  is an integer }.Which of the following is correct?

A) A is accepted by an automata but not by B
B)  B is accepted by an automata but not by A
C)  Both A and B are accepted by an automata
D)None are accepted by automata

Comments

c) both accepted by automata

Answer 1

C)  Both A and B are accepted by an automata

Both are the same actually, 2 states are sufficient for it

Answer 2

answer is C as 2x is obviously divided by 2