I am wondering, is it is possible to create a regular language from a non regular language if we add or remove finite number of words from it?
say L is irregular, if we add or remove finite number of words can we create a regular language?
i might be mistaken, but since all regular languages are finite - if we add a finite amount to a non regular language - it still stays non regular, but if we substract, let's say a finite amount from infinity, it is still infinity.
so is it safe to say that in both cases a regular language cannot not be obtained by adding/substracting a finite amount of words?
i was told to ask this question here rather then in softwareengineering.
thank you very much for your help. really curious about that