edited by
177 views
2 votes
2 votes

which of the following is not a finite state language?

(a)  L = {02n ; n>=0} on ∑ = {0}

(b) L = {s | s ∈ {0,1}* and s when interpreted as a binary string is such that s mod 5 = 0 }

(c) L = {s | s ∈ {0,1}* and s when input from least significant bit to most significant bit is such that its integer interpretation is divisible by 2 }

(d) L = {0,0000,00000000,........} on ∑ = {0}

edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
Deepak9000 asked Nov 27, 2023
202 views
Why is C is regular as it non regular as?Please help me with this confusion
0 votes
0 votes
1 answer
2
M_Umair_Khan42900 asked Dec 29, 2022
754 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...
0 votes
0 votes
2 answers
4