Markov algorithm: Difference between revisions

Revision as of 11:19, 26 February 2013

Revision as of 04:16, 13 April 2013

Line 5:

==Algorithm==

The ''Rules'' is a sequence of pair of strings, usually presented in the form of ''pattern'' →→ ''replacement''. Some rules may be terminating.

Given an ''input'' string:

Line 65:

==References==

* 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 191–206.

* [[Andrey Markov (Soviet mathematician)|Andrey Andreevich Markov (1903-1979)]] 1960. ''The Theory of Algorithms.'' American Mathematical Society Translations, series 2, 15, 1-14.

Line 72:

* [http://sourceforge.net/projects/markov Markov algorithm interpreter]

* [http://nic-nac-project.de/~jcm/index.php?nav=projects Markov algorithm interpreter]

[[Category:Theory of computation]]

[[Category:Rewriting_systemsRewriting systems]]

[[Category:Models of computation]]