[Solved] How is it possible that the language a^n b^2n is regular if and only if it was finite such that 100 => n

by



How is it possible that the language a^n b^2n is regular if and only if it was finite such that 100 => n <= 0? [closed]

solved How is it possible that the language a^n b^2n is regular if and only if it was finite such that 100 => n <= 0? [closed]