Computer Science, asked by shivaninangare1911, 5 months ago

A language is regular if and only if -
Options
O Accepted by PDA
O Accepted by DFA
O Accepted by TM
O Accepted by LBA
Clear Response​

Answers

Answered by hetalpatel4121982
0

{\mathcal{Answering~your~Que}}

Accepted by TM

Answered by kumarabhinav001
0

Explanation:

only accept by dfa disease free drug free

Similar questions