2015-10-07 21:10:52 +02:00
|
|
|
\documentclass{article}
|
|
|
|
|
\usepackage{amsmath}
|
|
|
|
|
\usepackage{nccmath}
|
|
|
|
|
\DeclareMathSizes{10}{10}{10}{10}
|
|
|
|
|
\setlength{\parindent}{0pt}
|
|
|
|
|
\title{Konfluenz}
|
|
|
|
|
\date{ }
|
|
|
|
|
\begin{document}
|
2015-10-08 11:42:34 +02:00
|
|
|
\section*{Wichtige Lemmas}
|
|
|
|
|
\subsection*{Newman's Lemma:}
|
|
|
|
|
Ein stark normalisierendes und lokal Konfluentes Termersetzungssystem (TES) ist konfluent.
|
2015-10-08 12:07:30 +02:00
|
|
|
\subsection*{Critical Pair Lemma:}
|
|
|
|
|
Ein TES ist lokal konfluent, wenn alle kritischen Paare zusammenf\"uhrbar sind.
|
2015-10-07 21:10:52 +02:00
|
|
|
\section{Matching Table:}
|
|
|
|
|
Formeln:
|
|
|
|
|
\begin{align}
|
|
|
|
|
x \Uparrow ( y \Uparrow z) & \rightarrow_{0}
|
|
|
|
|
\; x \Uparrow (y \Downarrow y)
|
|
|
|
|
\\
|
|
|
|
|
x \Downarrow ( x \Downarrow y ) & \rightarrow_0
|
|
|
|
|
\; x \Downarrow y
|
|
|
|
|
\end{align}
|
|
|
|
|
- alle Regeln m\"ussen gegen alle anderen gematched werden
|
|
|
|
|
daher f\"ur \"ubersichtlichkeit:\\ \\
|
|
|
|
|
\begin{tabular}{l c r}
|
|
|
|
|
& 1 & 2 \\
|
|
|
|
|
1 & ? & ? \\
|
|
|
|
|
2 & ? & ? \\
|
|
|
|
|
\end{tabular}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2015-10-08 11:42:34 +02:00
|
|
|
|
2015-10-07 21:10:52 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
\begin{tiny}
|
|
|
|
|
\copyright\ Joint-Troll-Expert-Group (JTEG) 2015
|
|
|
|
|
\end{tiny}
|
|
|
|
|
\end{document}
|
