Usually there are fixed rules you can use to decide whether something is in canonical form.

In practical terms, one wants to be able to recognize the canonical forms.

The camera matrix is sometimes referred to as a canonical form.

A given word can actually be put into canonical form in quadratic time.

Containers can be seen as canonical forms for collection types.

This may make impracticable the use of a canonical form.

Thus D1 is in general not of standard canonical form; to make it so we must at least remove f.

A canonical form may simply be a convention, or a deep theorem.

Topological methods, on the other hand, do not start from a given canonical form.

Canonical form is in general preferred, used by all modern implementations.

The canonical form of marriage must be followed (unless dispensed).

Another normal form, the rational canonical form, works over any field.

The canonical form may be viewed as an explicit solution of the linear system.

A reference model architecture is a canonical form, not a system design specification.

This phenomenon is governed by the Jordan canonical form of the map.

Canonical forms are generally used to make operating with equivalence classes more effective.

Linear programs are problems that can be expressed in canonical form:

The poem was written on four tablets in its canonical form and consisted of 480 lines.

The tableau is still in canonical form but with the set of basic variables changed by one element.

However, a simple and powerful canonical form is obtainable.

The canonical form of the program is slightly more verbose:

Allowing negative exponents provides a canonical form for positive rational numbers.

By contrast, the existence of Jordan canonical form for a matrix is a deep theorem.

The result provides a simple framework to understand various canonical form results for square matrices over fields.

Data normalization is the process of reducing data to its canonical form.