String Rewriting System (SRS): Difference between revisions
Jump to navigation
Jump to search
(Created page with "A String Rewriting System (SRS) is a formal system that involves the manipulation and transformation of strings of symbols based on a set of rules. * <B>Context:</B> ** It can (typically) use Rewriting Rules to replace specific sequences of symbols within a string to transform the string into a new form. ** It can (often) be applied in Formal Language Theory, where it serves as a mechanism for defining language generation or transformation. ** It can rang...") |
No edit summary |
||
| Line 1: | Line 1: | ||
A [[String Rewriting System (SRS)]] is a [[formal system]] that involves the manipulation and transformation of strings of symbols based on a set of rules. | A [[String Rewriting System (SRS)]] is a [[formal mathematical system]] that involves the manipulation and transformation of strings of symbols based on a set of rules. | ||
* <B>Context:</B> | * <B>Context:</B> | ||
** It can (typically) use [[Rewriting Rule]]s to replace specific sequences of symbols within a string to transform the string into a new form. | ** It can (typically) use [[Rewriting Rule]]s to replace specific sequences of symbols within a string to transform the string into a new form. | ||
Revision as of 18:28, 25 April 2024
A String Rewriting System (SRS) is a formal mathematical system that involves the manipulation and transformation of strings of symbols based on a set of rules.
- Context:
- It can (typically) use Rewriting Rules to replace specific sequences of symbols within a string to transform the string into a new form.
- It can (often) be applied in Formal Language Theory, where it serves as a mechanism for defining language generation or transformation.
- It can range from being a Deterministic Rewriting System, where rules apply in a predictable manner, to being a Non-deterministic Rewriting System, where multiple rules might apply.
- It can enable the simulation of Computation Models by providing a means to model the behavior of Turing Machines and other Automata.
- It can be analyzed for properties such as Confluence and Termination, which determine the behavior of the system under repeated application of rules.
- ...
- Example(s):
- a Post Canonical System that showcases the generative power of simple rewriting rules.
- a Markov Algorithm that demonstrates the application of string rewriting in algorithmic processes.
- ...
- Counter-Example(s):
- Context-Free Grammars, which use production rules in a structured format distinct from the direct symbol replacement used in SRS.
- ...
- See: Rewriting Rule, Formal Language Theory, Confluence, Termination, Abstract Rewriting System.