The case in which a string (in a language) may be decomposed to another string and a suffix

(grammar) Relating to left recursion

(computing) The condition in which a program or document either directly or indirectly requests that it include itself, without protection against an endless sequence of continued requests to include itself.

(computing theory) A kind of top-down parsing involving a set of mutually recursive procedures, each of which implements one of the non-terminals of the grammar, so that the structure of the parser program closely mirrors that of the grammar.

(computing theory) Describing a set for which there exists a deterministic algorithm that will list all items not in that set.

plural of recursive neural network

(artificial intelligence) A kind of deep neural network created by applying the same set of weights recursively over a structured input, to produce a structured prediction over variable-size input structures.