Register

Why a^n / n is odd (even) is regular Language ?

• retagged by
2,409 views
1 1 vote
How could we construct a FA by finding out a pattern in this language

if we take n is odd then we consider n=1 ,3 ,5 ,7  (here string is in AP so we would be able to find out FA)

 it is okay but it it not said that we should only take n =1 3 5 7 9

we could also take n= 3 ,99 ,79 ,5 ,17,9,13  (this is also odd but now there is no pattern now how can we construct a FA )....

can someone explain this ?

Assume same for if n is even.

1 Answer

2 2 votes
a^n where n is odd means..
A language which consists of strings such that.. in each such possible string, the number of a's is odd..
OR
L = {a,aaa,aaaaa,aaaaaaa....}  /* There are infinite such strings in the given language */

now your arguement has a problem..
What does n is odd mean..
n can be 1,3,5,7,9... or n is of the form 2p+1, where p =0,1,2,...
So the language should satisfy any possible such value..

When you say we can take n=3,99,79,..
It is wrong because then n doesnot refer to the set of ALL Odd numbers.. it is a proper subset of ODD numbers..
Voting & Accepting an answer helps improve the community
← Previous · Assume that source S...Next → · matrix doubt
← Previous in category · Find complement of t...Next in category → · Peter Linz Edition 4...
Position:
Show:

Related questions

2 2 votes
2 answers 2 answers
1.9k
1.9k views
Mojo-Jojo asked Sep 28, 2015
1,886 views
Why is $a^{n}b^{n} \cup a^{*}b^{*}$ regular ?
Why is $a^{n}b^{n} \cup a^{*}b^{*}$ regular ?Does this imply that a subset of non regular language can be regular ?
0 0 votes
2 2 answers
1.3k
1.3k views
iarnav asked Dec 22, 2018
1,336 views
#TOC Regular Language Is this a regular set?
WXW^R where W,X belongs to (0,1)*W^R is reverse of a string!
0 0 votes
0 0 answers
423
423 views
csenoob asked Dec 8, 2018
423 views
proving a language is regular based on two regular language over same $\Sigma$ (complicated)
Hello,I’ve encountered with a difficult question i don’t know how to solve. the question is about proving that a language is regular based on two language over the same $...