연습장: 두 판 사이의 차이

youngwiki
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 w be any string over an Σ.
By the definition, the domain of w is a finite initial segment of .
This means that n s.t. w is defined at ii<n

Uniquness)
Suppose that n,m s.t. both satisfy the condition for the string w.
That means, w is defined at position i if and only if (i<n)(i<m).
By definition, {i|i<n} and {i|i<m} are both domain of w, which means they are same set.
So the only way that {i|i<n} and {i|i<m} are same is their endpoints are same. Therefore, n=m.

Hence, there exists a unique natural number n with the desired property.

Ex. 2

Existence)
By definition, the domain of w is the finite initial segment of .
If the domain is , then there is no position i where the w is defined.
In this situation, the length of the string w is 0.
Hence, there is a string w s.t. |w|=0.

Uniquness)
Suppose that there is two sets u,v s.t. |u|=0,|v|=0.
Then u,v are not defined at any index, so both are empty relation, subset of ×Σ.
So u,v are both empty, which means u=v.

Hence, there is the a unique empty string w s.t. |w|=0, and we can define ϵ as the empty string w

Ex. 3

Let w be any string over an Σ.
Existence)
By the definition of w, w is defined at any position i s.t. (i)(i|w|).
Therefore, if i<|w|, then xΣ.(i,x)w.

Uniquness)
By the definition of w, relation w×Σ is partial function.
So there is only one output xΣ when i is given s.t. i<|w|i.

Hence, For all strings w and for all i, if i<|w|, then there exists a unique xΣ s.t. (i,x)w.

Ex. 4