4 votes 4 votes The number of proper prefixes for a string of length $n$ are ___________. $n+1$ $n(n+1)/2$ $n-1$ $(n-1)/2$ Compiler Design tbb-cd-1 compiler-design combinatory counting + – Bikram asked Nov 25, 2016 • retagged Sep 14, 2020 by ajaysoni1924 Bikram 575 views answer comment Share Follow See 1 comment See all 1 1 comment reply sripo commented Dec 24, 2018 reply Follow Share What if it is number of proper suffixes? 0 votes 0 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes for the string of string 'abc', proper prefixes are a, ab. Bikram answered Nov 25, 2016 • selected Dec 18, 2016 by Arjun Bikram comment Share Follow See all 7 Comments See all 7 7 Comments reply Hradesh patel commented Dec 16, 2016 reply Follow Share why not--------> epsilon, a, ab so its 3 –2 votes –2 votes Bikram commented Dec 16, 2016 reply Follow Share because epsilon means Null value . 0 votes 0 votes Arjun commented Dec 18, 2016 reply Follow Share "proper" means null string and full string must be excluded from the prefix. 12 votes 12 votes Hradesh patel commented Dec 18, 2016 reply Follow Share thks sir....for clear concept 0 votes 0 votes ukn commented Jan 17, 2017 reply Follow Share wht is the meaning of " proper prefixes "? please explain 0 votes 0 votes Bikram commented Jan 17, 2017 reply Follow Share " proper prefixes " means null string and full string must be excluded from the prefix. like epsilon means Null value . so exclude epsilon . 1 votes 1 votes Hradesh patel commented Jan 17, 2017 reply Follow Share @ bikram @ arjun Sir ........thks sir because here before i used epsilon in prefix and i only exclued full string but i am corrected now thks 2 votes 2 votes Please log in or register to add a comment.