Can someone check my answer for this question (Computer Theory question)

The alphabet in this question is Σ = {a b}. (a) A string is called a palindrome if it is the same when read from left to right as it is when read from right to left. For example, abaaba, babab and Λ are palindromes whereas abab is not. Let L be the language of all palindromes. (i) Name the first five words in L in lexicographic order. So my answer to this will b L1={ transition, a, aa, ba, aaa, aab, aba, abb} is this correct? if not please explain me the correct answer. thanks

Looking for this or a Similar Assignment? Click below to Place your Order

Open chat
%d bloggers like this: