automata theory Consider the following alphabet: Sigma = {[0 0], [0 1], [1 0], [

Question

automata theory

Consider the following alphabet: Sigma = {[0 0], [0 1], [1 0], [1 1]} Here, Sigma contains all rows of 0s and 1s of size 2, A string of symbols in Sigma gives two columns of 0 and 1's. Consider each column to be a binary number and let: L = {w Element Sigma* | the last column of w is twice the first column} For example [0 0] [0 1] [1 0] [0 0] Element L (because the first columns form the number 0010 =2 and the second columns form the binary number 0100 = 4) and [0 0] [0 1] [1 0] [0 1] NotElement L (because the first columns form 0010 = 2 and the second columns form 0101 = 5). Show that L is regular.

Explanation / Answer

with the given size of row is 2, no of possible column= 1,2,4,8

that will be written as [00][01], [00][10],[01][00],[10][00],

so the no of column is finite.

finite language is always regular.

so that given L is regular.

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.