2 votes 2 votes Let $Z$ consist of all the binary strings beginning with a $1$ whose value when converted to decimal is divisible by $7$. Which of the below statements is correct? $B$ can be recognized by a non-deterministic finite state automaton but not by a deterministic finite state automaton. $B$ can be recognized by a deterministic finite state automaton. $B$ can be recognized by a non-deterministic push-down automaton but not by a deterministic push-down automaton. $B$ cannot be recognized by any push down automaton— neither deterministic nor non-deterministic. GATE tbb-mockgate-4 theory-of-computation identify-class-language + – Bikram asked May 14, 2017 • edited Sep 4, 2019 by Counsellor Bikram 337 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes The given language is intersection of two regular languages. Intersection of two regular language is always regular. And regular language is accepted by a $DFA$ . Bikram answered May 14, 2017 • selected Sep 4, 2019 by Bikram Bikram comment Share Follow See all 2 Comments See all 2 2 Comments reply Harish Karnam commented Dec 12, 2017 reply Follow Share Given language is L = {111, 1110,10101,........} , how is this a intersection of two languages..can someone xplain? 0 votes 0 votes shauryav172 commented Jan 22, 2018 reply Follow Share D1= DFA that accepts binary string of numbers divisible by n , will have n states . (here n=7) D2= DFA with all binary strings starting with 1. Intersection will be regular. 3 votes 3 votes Please log in or register to add a comment.
