Markov algorithm

Normal algorithms are verbal, that is, intended to be applied to strings in different alphabets.

The definition of any normal algorithm consists of two parts: an alphabet, which is a set of symbols, and a scheme. The algorithm is applied to strings of symbols of the alphabet. The scheme is a finite ordered set of substitution formulas. Each formula can be either simple or final. Simple substitution formulas are represented by strings of the form ${\displaystyle L\to D}$ , where ${\displaystyle L}$  and ${\displaystyle D}$  are two arbitrary strings in the alphabet. Similarly, final substitution formulas are represented by strings of the form ${\displaystyle L\to \cdot D}$ .

Here is an example of a normal algorithm scheme in the five-letter alphabet ${\displaystyle |*abc}$ :

${\displaystyle \left\{{\begin{matrix}|b&\to &ba|\\ab&\to &ba\\b&\to &\\{*}|&\to &b*&\\{*}&\to &c&\\|c&\to &c\\ac&\to &c|\\c&\to \cdot \end{matrix}}\right.}$ 

The process of applying the normal algorithm to an arbitrary string ${\displaystyle V}$  in the alphabet of this algorithm is a discrete sequence of elementary steps, consisting of the following. Let’s assume that ${\displaystyle V'}$  is the word obtained in the previous step of the algorithm (or the original word ${\displaystyle V}$ , if the current step is the first). If of the substitution formulas there is no left-hand side which is included in the ${\displaystyle V'}$ , then the algorithm terminates, and the result of its work is considered to be the string ${\displaystyle V'}$ . Otherwise, the first of the substitution formulae whose left sides are included in ${\displaystyle V'}$  is selected. If the substitution formula is of the form ${\displaystyle L\to \cdot D}$ , then out of all of possible representations of the string ${\displaystyle V'}$  of the form ${\displaystyle RLS}$  (where ${\displaystyle R}$  and ${\displaystyle S}$  are arbitrary strings) the one with the shortest ${\displaystyle R}$  is chosen. Then the algorithm terminates and the result of its work is considered to be ${\displaystyle RDS}$ . However, if this substitution formula is of the form ${\displaystyle L\to D}$ , then out of all of the possible representations of the string ${\displaystyle V'}$  of the form of ${\displaystyle RLS}$  the one with the shortest ${\displaystyle R}$  is chosen, after which the string ${\displaystyle RDS}$  is considered to be the result of the current step, subject to further processing in the next step.

For example, the process of applying the algorithm described above to the word ${\displaystyle |*||}$  results in the sequence of words ${\displaystyle |b*|}$ , ${\displaystyle ba|*|}$ , ${\displaystyle a|*|}$ , ${\displaystyle a|b*}$ , ${\displaystyle aba|*}$ , ${\displaystyle baa|*}$ , ${\displaystyle aa|*}$ , ${\displaystyle aa|c}$ , ${\displaystyle aac}$ , ${\displaystyle ac|}$  and ${\displaystyle c||}$ , after which the algorithm stops with the result ${\displaystyle ||}$ .

For other examples, see below.

Any normal algorithm is equivalent to some Turing machine, and vice versa – any Turing machine is equivalent to some normal algorithm. A version of the Church-Turing thesis formulated in relation to the normal algorithm is called the "principle of normalization."

Normal algorithms have proved to be a convenient means for the construction of many sections of constructive mathematics. Moreover, inherent in the definition of a normal algorithm are a number of ideas used in programming languages aimed at handling symbolic information – for example, in Refal.

The Rules are a sequence of pairs of strings, usually presented in the form of pattern → replacement. Each rule may be either ordinary or terminating.

Given an input string:

1. Check the Rules in order from top to bottom to see whether any of the patterns can be found in the input string.
2. If none is found, the algorithm stops.
3. If one (or more) is found, use the first of them to replace the leftmost occurrence of matched text in the input string with its replacement.
4. If the rule just applied was a terminating one, the algorithm stops.
5. Go to step 1.

Note that after each rule application the search starts over from the first rule.

The following example shows the basic operation of a Markov algorithm.

1. "A" -> "apple"
2. "B" -> "bag"
3. "S" -> "shop"
4. "T" -> "the"
5. "the shop" -> "my brother"
6. "a never used" -> ."terminating rule"

"I bought a B of As from T S."

If the algorithm is applied to the above example, the Symbol string will change in the following manner.

1. "I bought a B of As from T S."
2. "I bought a B of apples from T S."
3. "I bought a bag of apples from T S."
4. "I bought a bag of apples from T shop."
5. "I bought a bag of apples from the shop."
6. "I bought a bag of apples from my brother."

The algorithm will then terminate.

These rules give a more interesting example. They rewrite binary numbers to their unary counterparts. For example, 101 will be rewritten to a string of 5 consecutive bars.

1. "|0" -> "0||"
2. "1" -> "0|"
3. "0" -> ""

"101"

If the algorithm is applied to the above example, it will terminate after the following steps.

1. "101"
2. "0|01"
3. "00||1"
4. "00||0|"
5. "00|0|||"
6. "000|||||"
7. "00|||||"
8. "0|||||"
9. "|||||"

• Formal grammar

• Caracciolo di Forino, A. String processing languages and generalized Markov algorithms. In Symbol manipulation languages and techniques, D. G. Bobrow (Ed.), North-Holland Publ. Co., Amsterdam, the Netherlands, 1968, pp. 191–206.
• Andrey Andreevich Markov (1903-1979) 1960. The Theory of Algorithms. American Mathematical Society Translations, series 2, 15, 1-14. (Translation from the Russian, Trudy Instituta im. Steklova 38 (1951) 176-189^[1])

• Yad Studio - Markov algorithms IDE and interpreter (Open Source)
• Markov algorithm interpreter
• Markov algorithm interpreter
• Markov algorithm interpreters at Rosetta-Code