Formal languages and Computability

45 Views Asked by At

Can someone please tell me how would you start proving this? Thanks Prove whether or not language L = {a^(p+qi) : p and q are fixed integer values, and i ≥ 0} is regular.

1

There are 1 best solutions below

7
On

HINT: Design either a DFA that accepts $L$, a regular grammar that produces $L$, or a regular expression that generates $L$; they’re all pretty straightforward.