The set of strings accepted by a finite state machine  M is called or denoted by

Compute ₈P₃

If (S,  ≤ ) is a poset and there is an a ∈ S such that for all other s ∈ S s ≤ a, then we say a is the __ element in (S,  ≤ ) 

In a transport network, a point of indegree zero is called a

Evaluate + - / 8 4 2 6

If S is a glob and T is a subset of S and is also a glob (using the same globness rules) then T is a ___of S

A relation that is reflexive, antisymmetric, and transitive is called a (two words)

In a rooted tree, the maximum length of a path from any given vertex to the root is called the __ of that tree

We know that a linearly ordered set is a lattice, because for one thing every  pair of elements a, and b is ordered, and if , say a ≤ b, then a ∨ b = 

All graphs consisting of an n-cycle for a given n, however labeled, are in the same isomorphism__