For a binary relation R on a set A, R is irreflexive if...

Which of the following statements are true about grammars? Select all that apply.

The four parts of a grammar are:

1. An alphabet N of grammar symbols called nonterminals.

2. An alphabet T of symbols called terminals. The terminals are distinct from the nonterminals.

3. A specific nonterminal S, called the start symbol.

4. A finite set of productions.

In the following grammar, which of the four parts of a grammar is b?

S → Λ | aB 

B → b | bB

The four parts of a grammar are:

1. An alphabet N of grammar symbols called nonterminals.

2. An alphabet T of symbols called terminals. The terminals are distinct from the nonterminals.

3. A specific nonterminal S, called the start symbol.

4. A finite set of productions.

In the following grammar, which of the four parts of a grammar is S?

S → Λ | aB 

B → b | bB

Which is a valid grammar for the following language:

{bb, bbbb, bbbbbb, …} = {(bb)ⁿ⁺¹ | n ∈ ℕ}

The four parts of a grammar are:

1. An alphabet N of grammar symbols called nonterminals.

2. An alphabet T of symbols called terminals. The terminals are distinct from the nonterminals.

3. A specific nonterminal S, called the start symbol.

4. A finite set of productions.

In the following grammar, which of the four parts of a grammar is B → b | bB?

S → Λ | aB 

B → b | bB

Which of the following is a valid inorder traversal of this binary tree?

Let's say we have the following definition of set A, and we want to define A inductively. Given the definition and basis below, what is the induction?

A = {1, 3, 7, 15, 31, …}

Basis: 1 ∈ A

Induction: ?

Which of the following statements about recursive functions are true? Select all that apply.

Given the following recursively defined string function:

f(Λ) = Λ,

f(ax) = b f(x)

f(bx) = a f(x)

Evaluate f(bbab).