Question

which language is recognised by a Finite automata?​

Answer 1

The language of a regular expression is accepted by Finite automata

Answer 2

Hola...

LANGUAGES RECOGNIZED BY FA. Let $ \Sigma$ be an alphabet. A language L over $ \Sigma$ is recognized by FA if there exists a finite automaton $ \cal {A}$ such that L is the language recognized by $ \cal {A}$.

Hope this helps u dude ✌

If helpful Mark it as Brainliest answer..