Construct DFA’s for Followingo viii. Construct the DFA that recognize the following language(or string) { anbm | n is divisible by 3 and m is divisible by 2 or n-m >=1} alphabet {a,b} ix. Design a DFA machine that accept the all language ( or strings) which are divisible by 3 over the input alphabet  = {0, 1,2,3,4,5,6,7,8,9} x. DFA machine that only accepts any sequence consisting of at least 3 one rupee coins over input alphabet {1,2, 5}

Q: Let B be the language defined as follows: B = { www | we (a, b}"} Let p be a positive integer and…

A: Below is the answer with reason:

Q: Let B be the language defined as follows: B = { www| we {a, b}*} Let p be a positive integer and k…

A: The value of ap-kbapbapb depends on value of p and k.  According to the language w belongs to (a, b)…

Q: Construct CFGs to accept all strings from the following languages: • R = a* R=a+ - R = a*b* • R =…

A: Context-Free Grammars (CFGs) to accept all strings from the given languages. Here are the CFGs for…

Q: In certain programming languages, comments appear between delimiters such as /# and #/.  Let C be…

A: Let M be the DFA that recognizes the language C.The state diagram of M is as follows.

Q: 0 or more

A: DFA  in which each input symbol determine the state

Q: Given the parent language L={w∈{a,b,c}}*, what is the language the following regular expression…

A: Given, L={w∈{a,b,c}}* Regular Expression = /([a-c]*a[a-c]*b[a-c]*)|([a-c]*b[a-c]*a[a-c]*)/