연습장: 두 판 사이의 차이
| 28번째 줄: | 28번째 줄: | ||
==Ex. 3== | ==Ex. 3== | ||
Let <math>w</math> be any string over an <math>\Sigma</math>.<br> | |||
Existence)<br> | |||
By the definition of <math>w</math>, <math>w</math> is defined at any position i s.t. <math>(i \in \mathbb{N}) \land (i \in |w|)</math>.<br> | |||
Therefore, if <math>i < |w| </math>, then <math>\exist x \in \Sigma. (i,x)\in w</math>. | |||
Uniquness)<br> | |||
By the definition of <math>w</math>, relation <math>w \subseteq \mathbb{N} \times \Sigma</math> is partial function.<br> | |||
So there is only one output <math>x \in \Sigma</math> when i is given s.t. <math>i < |w| \land i \in \mathbb{N}</math>. | |||
Hence, For all strings <math>w</math> and for all <math>i \in \mathbb{N}</math>, if <math>i < |w|</math>, then there exists a | |||
unique <math>x \in \Sigma</math> s.t. <math>(i, x) \in w</math>. | |||
==Ex. 4== | |||
<math></math> | |||
<math></math> | |||
<math></math> | |||
<math></math> | |||
<math></math> | |||
<math></math> | |||
<math></math> | |||
<math></math> | |||
<math></math> | |||
<math></math> | |||
<math></math> | <math></math> | ||
<math></math> | <math></math> | ||
2025년 9월 23일 (화) 02:57 판
Ex. 1
Existence)
Let be any string over an .
By the definition, the domain of is a finite initial segment of .
This means that s.t. w is defined at
Uniquness)
Suppose that s.t. both satisfy the condition for the string .
That means, w is defined at position if and only if .
By definition, and are both domain of , which means they are same set.
So the only way that and are same is their endpoints are same. Therefore, .
Hence, there exists a unique natural number with the desired property.
Ex. 2
Existence)
By definition, the domain of is the finite initial segment of .
If the domain is , then there is no position where the is defined.
In this situation, the length of the string is 0.
Hence, there is a string s.t. .
Uniquness)
Suppose that there is two sets s.t. .
Then are not defined at any index, so both are empty relation, subset of .
So are both empty, which means .
Hence, there is the a unique empty string s.t. , and we can define as the empty string
Ex. 3
Let be any string over an .
Existence)
By the definition of , is defined at any position i s.t. .
Therefore, if , then .
Uniquness)
By the definition of , relation is partial function.
So there is only one output when i is given s.t. .
Hence, For all strings and for all , if , then there exists a unique s.t. .
Ex. 4