There was a question something like, Consider the language of all integers converted to binary form. The language of all strings divisible by 7 is :1) Recognizable by a finite-automaton.2) Recognizable by a Non-deterministic finite-automaton.3) Recognizable by a deterministic Pushdown Automaton.4) Recognizable by a Non-deterministic Pushdown Automaton.5) Not recognizable by any of the above.I'm curious to know the answer and its reason.
Language of binary strings divisible by 7
formal languages;context free;regular languages;pushdown automata