edited by
421 views
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

edited by

2 Answers

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

No related questions found