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

Price: $5 USD

Question description

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

Tutor Answer

(Top Tutor) Daniel C.
School: Boston College
Studypool has helped 1,244,100 students
Ask your homework questions. Receive quality answers!

Type your question here (or upload an image)

1827 tutors are online

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors