The PatternEquivalent command determines whether the two strings s and t define equivalent (isomorphic) patterns. Two strings s and t are pattern equivalent if they have the same length and if, for all indices i and j with $1<=i<j<=\mathrm{length}\left(s\right)$ one has $s_i=s_j$ if, and only if, $t_i=t_j$.

The PatternCanonicalForm command computes the pattern canonical form of the string s. This is defined to be the lexicographically least string pattern equivalent to s. Note that two strings are pattern equivalent precisely when they have the same pattern canonical form.

Since the numerically least character that can appear in a Maple string has ASCII value equal to $1$, and low ASCII values are generally not printable, the PatternCanonicalForm command takes a 'base' = ch option, which allows you to specify the numerically least character you would like to appear in the output string. In the presence of this option, the pattern canonical form is computed using the specified character rather than the character Char( 1 ). This option is intended mainly for interactive use and debugging. The PatternCanonicalForm command runs measurably faster in the absence of the base option.

All of the StringTools package commands treat strings as (null-terminated) sequences of $8$-bit (ASCII) characters.  Thus, there is no support for multibyte character encodings, such as unicode encodings.

$\mathrm{with}\left(\mathrm{StringTools}\right)\&colon;$

$\mathrm{PatternEquivalent}\left(''abc''\&comma;''xyz''\right)$

$\mathrm{true}$

$\mathrm{PatternEquivalent}\left(''abc''\&comma;''xyx''\right)$

$\mathrm{false}$

$\mathrm{Visible}\left(\mathrm{PatternCanonicalForm}\left(''abc''\right)\right)$

$''\backslash 1\backslash 2\backslash 3''$

$\mathrm{PatternCanonicalForm}\left(''abc''\&comma;'\mathrm{base}'=''a''\right)$

$''abc''$

$\mathrm{PatternCanonicalForm}\left(''xyz''\&comma;'\mathrm{base}'=''a''\right)$

$''abc''$

$\mathrm{PatternCanonicalForm}\left(''xyx''\&comma;'\mathrm{base}'=''a''\right)$

$''aba''$