a) There exists a unique DFA for every regular language
b) NFA can always are converted to a PDA
c) Complement of CFL is always recursive
d) Every NDFA can be converted to a DFA
Which one is a FALSE statement?
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Which one is a FALSE statement?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!