41. A language is regular if and only if A. Accepted by DFA B. Accepted by PDA C. Accepted by LBA D. Accepted by Turing machine

By ayush goel in 7 Oct 2023 | 03:26 pm
ayush goel

ayush goel

 Student
Posts: 346
Member since: 21 Sep 2023

41. A language is regular if and only if
A. Accepted by DFA
B. Accepted by PDA
C. Accepted by LBA
D. Accepted by Turing machine
7 Oct 2023 | 03:26 pm
0 Likes

Report

Please describe about the report short and clearly.