Answer :
The categories of sentence construction rules that contain recursion as a feature are Option A and E, NP → N PP; PP → P NP and S → NP VP; VP → V CP; CP → C S
When given any bounded input string, a Turing computer will pause and accept the string if it is in the language and halt and reject it in all other cases. This is known as a recursive language.
Recursive refers to the ability of a linguistic or grammatical structure to be utilized again in a sequence.
sentence structure Rules are those that go like this: X Y Z According to this rule, the node X should be expanded into the branches Y & Z. Another option is to read "if a Y and a Z are close to each other, then can combine them to form" from right to left (either from below).
Learn more about recursion at
https://brainly.com/question/29453527?referrer=searchResults
#SPJ4
The question is -
Which sets of Phrase Structure rules have the property of recursion?
(Note: Answer the question based on the rules given in each set exactly as written here. Do not change any of the rules, or add in any other rules that you may have learned from class.)
Choose ALL that apply.
A) NP ---> N PP; PP ---> P NP
B) NP ---> D N; PP ---> P NP
C) VP ---> V NP; NP ---> D N
D) S ---> NP VP; VP ---> V NP; NP ---> D N
E) S ---> NP VP; VP ---> V CP; CP ---> C S