0

I know what regular and context free language are and how regular language needs finite memory, and other related stuff. What concerns me is that I think if an bm such that n and m have some relation between them then they can not be regular, but I cant find any such thing written anywhere. Am I correct to state so?

Brian Tompsett - 汤莱恩
  • 5,753
  • 72
  • 57
  • 129
sandeep bisht
  • 111
  • 12
  • 1
    This question appears to be off-topic because it is about CS theory (try http://cs.stackexchange.com). – Oliver Charlesworth May 05 '14 at 10:36
  • May be u r right sir but at least programmers can have their say on the topic. – sandeep bisht May 05 '14 at 10:50
  • Yes you are correct. To argu the fact you need to explain limitations of Finite Automata (class of automata for regular languages) and need to explain what is called regular language. I have answered this: [What is basically a regular language? And Why `a*b*` is regular? But languages like `{ a^nb^n | n > 0 }` is not a regular language](http://stackoverflow.com/questions/16723185/is-ab-regular/16730707#16730707) – Grijesh Chauhan May 23 '14 at 05:17
  • @GrijeshChauhan sir i beg to differ not on the answer you gave but on this question being duplicate .My point was that given every relation between 'n' and 'm' can we imply that the language is not regular?Or are there relations for which this hypothesis fails.can we categorize those relations. – sandeep bisht May 23 '14 at 09:09
  • @sandeepbisht that is what I answered their! .... to categorize those relations you just need to understand limitations of finite automata. -- a^na^m may be a regular or a *not* regular. A language will not be regular if information about `n` has be stored unbound. – Grijesh Chauhan May 23 '14 at 11:08
  • @GrijeshChauhan i know "...information about n has be stored unbound" – sandeep bisht May 26 '14 at 05:16
  • @GrijeshChauhan sir i know "...information about n has be stored unbound" I was expecting some more information on relationship between n and m .....example of a relationship between n and m which make a^n b^n regular...n=m mod 15 may be an example(i think it is ) other such examples...and then categorize them. – sandeep bisht May 26 '14 at 05:23
  • @sandeepbisht :( if it doesn't answer you. You may like to ask CS.stackexchange – Grijesh Chauhan May 26 '14 at 05:39

0 Answers0