48. Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L? A. n-1 B. n C. n+1 D. 2n-1

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

ayush goel

 Student
Posts: 346
Member since: 21 Sep 2023

48. Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L?
A. n-1
B. n
C. n+1
D. 2n-1
7 Oct 2023 | 03:28 pm
0 Likes

Report

Please describe about the report short and clearly.