Hi,
Q1. A regular language is any (finite or infinite) set of (finite) strings? True
finite set: L= w | w is a set of 'a's less than 1000
inifinite set L= a^n | n >= 0
Q2. A non-regular language is any (finite or infinite) set of (infinite) strings? True
infinite set L= a^n . b^n | n>=0
finite set L=?
Some body please guide me if the true/false are correct and what is an example of a non-regular language having a finite set of infinite length strings?
Zulfi.
Q1. A regular language is any (finite or infinite) set of (finite) strings? True
finite set: L= w | w is a set of 'a's less than 1000
inifinite set L= a^n | n >= 0
Q2. A non-regular language is any (finite or infinite) set of (infinite) strings? True
infinite set L= a^n . b^n | n>=0
finite set L=?
Some body please guide me if the true/false are correct and what is an example of a non-regular language having a finite set of infinite length strings?
Zulfi.