I've heard somewhere that since the latter is bounded, it is regular. Can anyone explain me what a bound actually means?
And if the latter is regular, then how would you write the regular expression for it?
Asked
Active
Viewed 259 times
1
Siddharth Thevaril
- 875
- 4
- 15
- 27
-
3The title and the question seem to contradict each other. Is your title the wrong way around? – TonyK Jan 10 '15 at 16:36
-
1Bounded here means finite. Each finite language is regular. The regular expression is simply $w_1 + w_2 +\dots + w_n$, where $(w_m)_{m=1,\dots,n}$ is an enumeration for the language. – PhoemueX Jan 10 '15 at 16:53
-
@TonyK my mistake, corrected. – Siddharth Thevaril Jan 10 '15 at 17:52
-
Of course, in this case, there are $10^{10}$ cases, so the resulting regular expression would be rather long... – Zhen Lin Jan 10 '15 at 19:59
-
What is happening there? – Did Jan 11 '15 at 16:15