-1

I tried to solve it using L=a*as anti-example, but it seems wrong.

{0, a, aa, ...} has to do with the number of strings

any suggestions?

Qehu
  • 135
  • 2
  • 14
  • "..." means there is no end, no? So there are infinitely many words, and you have indeed found a regular language that is not finite. – Peter Leupold Jun 11 '16 at 17:21
  • Read [this](http://stackoverflow.com/questions/16723185/is-ab-regular/16730707#16730707) and [this](http://cs.stackexchange.com/questions/23776/is-it-compulsory-that-every-infinite-set-be-non-regular/23782#23782) – Grijesh Chauhan Jun 15 '16 at 07:11
  • thanks for the links – Qehu Jul 21 '16 at 12:17

2 Answers2

0

A regular Language simply means the language consists of finite number of equivalence classes (set partitions) in which the string can be distributed . These strings can be however of any length. There is no limit on the number of strings as well as long as it can be designated to one of the equivalence class. Thus a language can be regular if even if it is infinite.

Shubham Singh rawat
  • 129
  • 1
  • 6
-2

Finite language means Language of which all strings are of finite length.

For example language A subset of L which has strings of length atmost 3

Regular language means language of which all strings are recognised by a finite state machine.

For example L=a* is recognised by FSM.so it will be a Regular language.

So,we can say every finite language is regular,but inverse is not true.

Community
  • 1
  • 1
Hailey
  • 157
  • 1
  • 18
  • 1
    No, finite language usually means a language with only finitely many strings. Even in an infinite language every single string is of finite length: in a* every a^n has length n - finite. On the other hand there are notions of regularity even for langauages of infinte strings; see Büchi automata. – Peter Leupold Jun 15 '16 at 15:09