1 votes 1 votes 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 neha singh asked May 12, 2017 edited May 12, 2017 by Prashant. neha singh 421 views answer comment Share Follow See 1 comment See all 1 1 comment reply pawan kumarln commented May 13, 2017 reply Follow Share c) both accepted by automata 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes C) Both A and B are accepted by an automata Both are the same actually, 2 states are sufficient for it Angkit answered May 15, 2017 Angkit comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes answer is C as 2x is obviously divided by 2 IRSHAD KHAN answered May 23, 2017 IRSHAD KHAN comment Share Follow See all 0 reply Please log in or register to add a comment.