Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In theoretical computer science and mathematical logic a string rewriting system (SRS), historically called a semi-Thue system, is a rewriting system over strings from a (usually finite) alphabet. Given a binary relation R between fixed strings in the alphabet, called rewrite rules, denoted by s ightarrow t, an SRS extends the rewriting relation to all strings in which the left- and right-hand side of the rules appear as substrings, that is usv ightarrow utv, where s, t, u, and v are strings. The notion of a semi-Thue system essentially coincides with the presentation of a monoid. Thus they constitute a natural framework for solving the word problem for monoids and groups.

Под заказ:
	OZON.ru - 3750 руб.	Перейти

Рейтинг книги: 4 из 5, 7 голос(-ов).