If a Turing machine with input string x ends in a final state with output ∧y∧ iff f(x) = y then we say that the function f is 

In a TM built to show TC the only edge leading from the start state is labelled

Change the hex digit B to a base 10 numeral

Consider the graph G =  If you build a minimal spanning tree for G, adding edges per Kruskal's algorithm, what is the order in which vertices are added?

Consider the graph Using a breadth first algorithm with the usual preference on vertices, in what order would the vertices be added to get a spanning tree?

Ir r is a regular expression over a set A, write the expression that in many versions means "one or more instances of r".

Given TM = (S, I, O, δ, σ₀) C_i represents

In the version of EBNF that became the ECMA and ISO standard, the production symbol is

In the definition of a finite state automaton, N means

The function 0cons does what?