# String Rewriting Systems

Open access

## String Rewriting Systems

Basing on the definitions from [15], semi-Thue systems, Thue systems, and direct derivations are introduced. Next, the standard reduction relation is defined that, in turn, is used to introduce derivations using the theory from [1]. Finally, languages generated by rewriting systems are defined as all strings reachable from an initial word. This is followed by the introduction of the equivalence of semi-Thue systems with respect to the initial word.

Keywords:
References
• [1] Grzegorz Bancerek. Reduction relations. Formalized Mathematics, 5(4):469-478, 1996.

• [2] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.

• [3] Czesław Byliński. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529-536, 1990.

• [4] Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.

• [5] Patricia L. Carlson and Grzegorz Bancerek. Context-free grammar - part 1. Formalized Mathematics, 2(5):683-687, 1991.

• [6] Markus Moschner. Basic notions and properties of orthoposets. Formalized Mathematics, 11(2):201-210, 2003.

• [7] Karol Pαk. The Catalan numbers. Part II. Formalized Mathematics, 14(4):153-159, 2006.

• [8] Andrzej Trybulec. Subsets of complex numbers. To appear in Formalized Mathematics.

• [9] Andrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1(2):329-334, 1990.

• [10] Andrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1):115-122, 1990.

• [11] Andrzej Trybulec. Tarski Grothendieck set theory. Formalized Mathematics, 1(1):9-11, 1990.

• [12] Michał Trybulec. Formal languages - concatenation and closure. Formalized Mathematics, 15(1):11-15, 2007.

• [13] Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.

• [14] Tetsuya Tsunetou, Grzegorz Bancerek, and Yatsuka Nakamura. Zero-based finite sequences. Formalized Mathematics, 9(4):825-829, 2001.

• [15] William M. Waite and Gerhard Goos. Compiler Construction. Springer-Verlag New York Inc., 1984.

• [16] Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73-83, 1990.

• [17] Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990.

• [18] Edmund Woronowicz and Anna Zalewska. Properties of binary relations. Formalized Mathematics, 1(1):85-89, 1990.

# Formalized Mathematics

## (a computer assisted approach)

### Journal Information

SCImago Journal Rank (SJR) 2016: 0.207
Source Normalized Impact per Paper (SNIP) 2016: 0.315

Target Group

researchers in the fields of formal methods and computer-checked mathematics

### Metrics

All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 3 3 3