A language is regular if and only if it is accepted by finite automata.
Posted: Thu Jul 14, 2022 9:07 am
a) The given statement statement is true
b) Given statement is false
c) Statement is partially true
d) None of the mentioned
b) Given statement is false
c) Statement is partially true
d) None of the mentioned