Find link

language:

Find link is a tool written by Edward Betts.

searching for Free monoid 9 found (69 total)

James reduced product (148 words) [view diff] exact match in snippet view article find links to article

(x1,...,xk−1, xk+1,...,xn). In other words, its underlying set is the free monoid generated by X (with unit e). It was introduced by Ioan James (1955)

Word problem for groups (4,910 words) [view diff] exact match in snippet view article find links to article

of inverses that map to the identity under the natural map from the free monoid with involution on A {\displaystyle A} to the group G {\displaystyle

Post correspondence problem (2,521 words) [view diff] exact match in snippet view article find links to article

may be phrased in terms of monoid morphisms f, g from the free monoid B∗ to the free monoid A∗ where B is of size n. The problem is to determine whether

Gennady Makanin (1,099 words) [view diff] exact match in snippet view article find links to article

(1999). "Functions for parametrization of solutions of an equation in a free monoid". Transactions of the American Mathematical Society. 352 (1): 1–54. doi:10

Splicing rule (388 words) [view diff] exact match in snippet view article find links to article

languages. Let A be an alphabet and L a language, that is, a subset of the free monoid A∗. A splicing rule is a quadruple r = (a,b,c,d) of elements of A∗, and

Monoidal category (2,431 words) [view diff] exact match in snippet view article find links to article

m'\leq n'} implies m + m ′ ≤ n + n ′ {\displaystyle m+m'\leq n+n'} . The free monoid on some generating set produces a monoidal preorder, producing the semi-Thue

Natural number (5,873 words) [view diff] exact match in snippet view article find links to article

(\mathbb {N} ,+)} is a commutative monoid with identity element 0. It is a free monoid on one generator. This commutative monoid satisfies the cancellation

Knuth–Bendix completion algorithm (2,412 words) [view diff] exact match in snippet view article find links to article

defining relations on X. Let X* be the set of all words in X (i.e. the free monoid generated by X). Since the relations R generate an equivalence relation

Mobile membranes (7,128 words) [view diff] exact match in snippet view article find links to article

(ranged by M , N , … {\displaystyle M,N,\dots } ) os defined by using the free monoid V ∗ {\displaystyle V^{*}} (ranged over by u , v , … {\displaystyle u