Myhill Nerode Theorem for Fuzzy Automata (Min-max Composition)
|
|
- Ἀλαλά Βυζάντιος
- 5 χρόνια πριν
- Προβολές:
Transcript
1 Intern. J. Fuzzy Mathematical Archive Vol. 3, 2013, ISSN: (P), (online) Published on 30 December International Journal of Myhill Nerode Theorem for Fuzzy Automata (Min-max Composition) V. Ramaswamy 1 and K. Chatrapathy 2 1 Bapuji College of Engineering and Technology, VTU-Belgaum, India researchwork04@yahoo.com 2 School of Engineering and Technology, JAIN University, India kcpathy@yahoo.in Received 20 December 2013; accepted 28 December 2013 Abstract. In this paper, Myhill Nerode theorem of finite automaton has been extended to fuzzy automaton where the composition considered is min-max composition. In the case of max-min composition, it has already been proved that if L is a fuzzy regular language, then for any α [0, 1], L α = L (D α (M)) [3]. In the case of max-product composition L α is only a subset of L (D α (M)). But still Myhill Nerode theorem has been extended to max-product composition [4]. In the case of max-average composition, L α is not even contained in L (D α (M)). This lead to lots of challenges and we had to resort to splitting to prove the analogue of Myhill Nerode Theorem for max-average composition. In a similar line, an attempt has been made in this paper to study the behavior of fuzzy automata under min-max composition and to prove the analogue of Myhill Nerode Theorem for min - max composition. An algorithm to compute L(s) for any string s is also developed. Keywords: Monoid, min-max composition, finite automaton, equivalence class, fuzzy regular language, fuzzy automaton AMS Mathematics Subject Classification (2010): 68Q45, 68Q70 1. Introduction Let A be a finite non empty set. A fuzzy automaton over A is a 4-tuple M = (Q, f, I, F) where Q is a finite nonempty set, f is a fuzzy subset of Q x A x Q, I and F are fuzzy subsets of Q. In other words, f: Q x A x Q [0, 1] and I, F: Q [0, 1]. Let S be a free monoid with identity element e generated by A. If s S, then s can be written as a 1 a 2 a n where a i A. Here n is called the length of s and we write s = n. We now extend f to a function f * : Q x S x Q [0, 1] defined as f * (q, e, p) = 0 if q = p, 1 otherwise. f * (q, sa, p) = [ f * (q, s, r) f (r, a, p)] (s S, a A) r Q It can be shown that f* (q, a, p) = f (q, a, p) for all p, q Q and for all a A. 58
2 Myhill Nerode Theorem for Fuzzy Automata (Min-max Composition) Definition 1.1. Let M = (Q, f *, I, F) be a fuzzy automaton over S. We define the language accepted by M denoted by L (M) to be a fuzzy subset of S defined as L (M) (s) = I o f s * o F for all s S. Here o denotes min-max composition. Definition 1.2. A fuzzy subset L of S is said to be a fuzzy regular language if L= L(M) where M is a fuzzy automaton over S. 2. Myhill Nerode Theorem for Fuzzy Automata Let S be a monoid with identity element e and L be a fuzzy subset of S. Then the following statements are equivalent. (i) L is a fuzzy regular language. (ii) L can be expressed as a fuzzy union L = (δ 1 ) L (δ 2 ) L (δ t ) L where δ 1, δ 2, δ t [0, 1]. For each i = 1,2 t, (δi) L = δi. L δi where L δi = U [s] δi. This union is a set theoretic union and [s] δi denotes the equivalence class of s of a right invariant equivalence relation of finite index in L δi. (iii) Define a relation R L as follows. If s, t ε S, then s R L t if and only if for all u S and for all α [0, 1], L(su) α only when L(tu) α. Then R L is a right invariant equivalence relation of finite index. Proof: (i) (ii) Since L is a fuzzy regular language, we have L = L (M) where M = (Q, f*, I, F) is a fuzzy automaton. Consider any α [0, 1]. With M and α, we associate a non-deterministic automaton D α (M) = (Q, d α, I α, F α ) where d α : Q x S 2 Q is defined as d α (q, s) = {p Q f* (q, s, p) α}, I α = {p Q I (p) α} and F α = {p Q F (p) α}. For the sake of simplicity, we will denote L (D α (M)) by L α (M). Let s L α. Then L(s) = L(M)(s) α. ie (I ο f s * ο F ) α which means [(f s * ο F) (p) I (p)] α p Q This means for any state p Q, I (p) α OR (f s * ο F) (p) α. This leads to the following three cases: Case A: I (p) α and (f s * ο F) (p) α Case B: I (p) < α and (f s * ο F) (p) α Case C: I (p) α and (f s * ο F) (p) < α We now consider each case separately. Case A: I (p) α and (f s * ο F) (p) α. In this case p I α. Now (f s * ο F) (p) α means [(f s *(p, r) F (r)] α r Q This leads to the following three cases: Case A 1 : f s * (p, r) α and F (r) α Case A 2 : f s * (p, r) α and F (r) < α Case A 3 : f s * (p, r) < α and F (r) α Case A 1 : f s * (p, r) = f* (p, s, r) α and F(r) α 59
3 V. Ramaswamy and K.Chatrapathy First alternative means r d α (p, s). F(r) α means r F α. Thus r d α (p, s) F α. Hence d α (p, s) F α φ where p I α. This proves that s L (Dα (M)) = Lα (M). (1) Case A 2 : f s * (p, r) α and F (r) < α Let F (r) = β < α. Then r F β. I (p) α > β means p I β. Also f s * (p, r) α > β means r d β (p, s). Thus r d β (p, s) and r F β so that d β (p, s) F β φ where p I β. This proves that s L (D β (M)) = L β (M). (2) Case A 3 : f s * (p, r) < α and F (r) α Let f s * (p, r) = γ < α. Then f*(p, s, r) = γ so that r d γ (p, s) F(r) α > γ means r F γ. I (p) α > γ means p I γ Thus r d γ (p, s) F γ so that d γ (p, s) F γ φ where p I γ. This proves that s L (D γ (M)) = L γ (M) (3) Case B: I (p) < α and (f s * ο F) (p) = [(f s *(p, r) F (r)] α. r Q This leads to the following three cases. Case B 1 : f s * (p, r) α and F (r) α Case B 2 : f s * (p, r) α and F (r) < α Case B 3 : f s * (p, r) < α and F (r) α Case B 1 : f s * (p, r) α and F (r) α. We already have I (p) < α. Let I (p) = λ < α. This implies p I λ. Now F (r) α > λ means r F λ and f s * (p, r) = f* (p, s, r) α > λ means r d λ (p, s). Thus r d λ (p, s) F λ so that d λ (p, s) F λ φ where p I λ. This proves that s L (D λ (M)) = L λ (M). (4).Case B 2 : f s * (p, r) α and F (r) < α. We already have I (p) < α. Let I (p) = ρ < α. Then p I ρ. Let F(r) = ϕ < α. Then r F ϕ. If ρ > ϕ, then I ρ I ϕ so that p I ϕ. Also f s * (p, r) = f* (p, s, r) α > ρ > ϕ which means r d ϕ (p, s). Thus there exists p I ϕ such that d ϕ (p, s) F ϕ φ. This proves that s L (D ϕ (M)) = L ϕ (M). (5) If ρ < ϕ, then r F ϕ F ρ Also f*(p, s, r) α > ρ implies r d ρ (p, s). I (p) = ρ means p I ρ. Thus r d ρ (p, s) F ρ so that d ρ (p, s) F ρ φ where p I ρ. This proves that s L (D ρ (M)) = L ρ (M). (6) Case B 3 : f s * (p, r) < α and F (r) α. We already have I (p) < α. Let I (p) = π < α. Then p I π and F(r) α > π implies r F π. Let f s * (p, r) = f*(p, s, r) = µ < α. If µ π, then F (r) α > µ implies r Fµ and f*(p, s, r) = µ means r d µ (p, s). Also I(p) = π µ means p I µ. Thus r d µ (p, s) Fµ so that d µ (p, s) Fµ φ where p I µ. This proves that s L (D µ (M)) = L µ (M). (7) If µ > π, then f*(p, s, r) = µ > π means r d π (p, s). Thus r d π (p, s) F π so that d π (p, s) F π φ where p Iπ. This proves that s L (D π (M)) = L π (M). (8) Case C: I (p) α and (f s * ο F) (p) < α. This implies f s * (p, r) < α and F (r) < α. 60
4 Myhill Nerode Theorem for Fuzzy Automata (Min-max Composition) We already have I (p) α. Let f s * (p, r) = ν < α and F (r) = Ω < α. First assume that ν > Ω. Now F (r) = Ω means r F Ω. Also f*(p, s, r) = ν Ω means r d Ω (p, s). Hence d Ω (p, s) F Ω φ. Also I (p) α > ν > Ω means p I Ω. Hence s L (D Ω (M)) = L Ω (M). (9). Suppose ν < Ω. Now F (r) = Ω > ν means r F ν. f*(p, s, r) = ν means r d ν (p, s) so that d ν (p, s) F ν φ. Also I (p) α > ν means p I ν. Hence s L (D ν (M)) = L ν (M). (10) From (1), (2), (3), (4), (5), (6), (7), (8), (9), and (10) it follows that L α L α (M) L β (M) L γ (M) L λ (M) Lφ(M) Lρ (M) Lµ(M) L π(m) L Ω (M) L ν(m) L σ (M) L η (M) where α, β, γ, λ, φ, ρ, π, ν, Ω, µ, σ, η [0,1]. Since each of the languages L α (M), L β (M), L γ (M), L π (M) are fuzzy regular languages accepted by non-deterministic automata D α (M), D β (M), D γ (M), D π (M) respectively, Myhill Nerode theorem for finite automata is applicable for each automaton. Let Q = {q 0, q 1, q 2.. q n }. For every s S, the possible values of L(s) are I(q 0 ), I(q 1 ), I(q n ), f(q i, a j, q k ) (q i, q k Q, a j A), F(q 0 ), F(q 1 ), F(q n ). Denote these fixed values (after arranging them in non decreasing order) by δ 1, δ 2.δ t. So, there can be only finitely many values of L(s) (s S). Then δ 1, δ 2 δ t [0, 1] and for each δi (1 i t), L δi (L α (M) L β (M) L γ (M) L λ (M) Lφ(M) Lρ (M) Lµ(M) L π(m) L Ω (M) L ν(m) L σ (M) L η (M)) Since L (D δi (M)) is the language accepted by a finite automaton, by Myhill Nerode theorem for finite automata, it follows that there exists a right invariant equivalence relation R i of finite index. Let R i ' denotes it s restriction on L δi. Similarly, we obtain other restrictions like M i ', N i ', O i ', P i ', Q i ', S i ', T i ', U i ', V i ', W i ', X i ', and Y i ' from L (D αi (M), L (D βi (M), L (D γi (M), L (D λi (M), L (D ϕi (M)), L (D ρi (M)), L (D πi (M)), L (D νi (M)), L (D Ωi (M)), L (D µi (M)), L(D σi (M)), L(D ηi (M)) respectively. Note that M i ', N i ', O i ', P i ', Q i ', S i ', T i ', U i ', V i ', W i ', X i ', and Y i ' are all right invariant equivalence relations of finite index. Hence Z i' = M i ' N i ' O i ' P i ' Q i ' S i ' T i ' U i ' V i ' W i ' X i ' Y i ' is a right invariant equivalence relation in L δi of finite index. Let [s] δi denote the equivalence class of S under this equivalence relation. Since the equivalence classes partition L δi, it follows that L δi = [s] δi. Next we will prove the fact that L = (δ 1 ) L (δ 2 ) L (δ t ) L. Define (δ i ) L = δ i. L δi. If s S such that L(s) δ i (s L δi ), then (δ i ) L (s) = δ i. Otherwise, (δ i ) L (s) = 0. We note that each (δ i ) L is a fuzzy set. Let s S and assume that L(s) = δ i. Now L(s) = δ i δ i + 1 δ t. Again, L(s) = δ i δ i 1 δ 1. Hence ((δ 1 ) L (δ 2 ) L (δ t ) L ) (s) = (δ 1 ) L (s) (δ 2 ) L (s) (δ t ) L (s) = δ 1 δ 2 δ i = δ i = L (s). This proves that L = (δ 1 ) L (δ 2 ) L (δ t ) L. Proof: (ii) (iii). If s S, then s R L s because for all u S and for all α [0,1], L(su) α only when L(su) α is obviously true. This proves that R L is reflexive. Clearly, R L is symmetric. If s R L t and t R L v, then for all u S and for all α [0,1], L(su) α only when L(tu) α only 61
5 V. Ramaswamy and K.Chatrapathy when L(vu) α proving that s R L v. Hence R L is transitive. R L is thus an equivalence relation. To prove R L is right invariant, assume that s R L t and u S. We have to prove that su R L tu. For this, we have to prove that for all v S and α [0,1], L(suv) α only when L(tuv) α which is the same as saying that L(sz) α only when L(tz) α where z = uv. But this is true since s R L t. We will now prove that R L is of finite index. For i = 1,2,,t, let R i denote the right invariant equivalence relation of finite index in L δi. Let R = R 1 R 2 R t. Then R is an equivalence relation of finite index. We will prove that s R t implies s R L t. This will mean that index (R L ) index (R). Since index (R) is finite, this will prove that index(r L ) is also finite. Assume that s R t. Consider any u S and any α [0, 1]. Suppose su L α. We have to prove that tu L α. Now α L (su) = δ j (say). Then su L δj which is a subset of L α. By definition of R, we have s R j t. Since R j is right invariant, su R j tu. Since L δj = U [v] δj, it follows that su belongs to one of the equivalence classes of R j and hence tu also belongs to the same equivalence class. Hence tu L δj and since L δj is a subset of L α, we have tu L α. Proof: (iii) (i) We have to define a fuzzy automaton M such that L = L (M). For every element s S, let [s] denote the equivalence class of s under the equivalence relation R L. Let Q = {[s] / s S}. Since R L is of finite index, it follows that Q is a finite set. Define I: Q [0, 1], f*: Q x S x Q [0, 1] and F: Q [0, 1] as follows. I ([s]) = 0 if [s] = [e] = 1 otherwise. f*([s], t, [u]) = 1 if [u] = [st], 0 otherwise. F ([s]) = L(s). We will first prove that F is well defined. For this, we have to prove that if [s] = [t], then L (s) = L (t). Assume that L (s) = β. We will prove that L (t) = β. Since [s] = [t], s R L t so that L (s) = L (se) β only when L(t) = L (te) β. Since L(s) β, it follows that L[t] β. Assume L [t] = γ > β. Take η = (β + γ) / 2. Clearly, β < η < γ = L[t]. Since s R L t, L[t] > η implies that L[s] η > β. But this contradicts the fact that L(s) = β. Hence our assumption that L[t] > β is wrong. Since L[t] β, it follows that L[t] = β. Take M = (Q, I, f*, F). Then M is a fuzzy automaton and it remains to prove that L = L (M). For this, we have to prove that for all s S, L (s) = L (M) (s). We have L (M) (s) = I o f s * o F = {I ([t]) (f* s o F) ([t])} [t] (f* s o F) ([t]) = {f* s ([t], [u]) F([u])} [u] = {f* ([t], s, [u]) F([u])} [u] Note that f*([t], s, [u]) = 0 if [ts] = [u] and 1 otherwise. Therefore, in the above expression f*([t], s, [u]) = 0 only when [ts] = [u]. In all remaining cases (ie. whenever [ts] [u]) the term f* ([t], s, [u]) F([u]) becomes 1. Thus the above equation becomes 62
6 Myhill Nerode Theorem for Fuzzy Automata (Min-max Composition) (f* s o F) ([t]) = F([u]) = L(ts) ( since F ([s]) = L(s)). Hence L (M)(s) = {I([t]) (f* s o F) ([t])} [t] Note that I([t]) = 0 only when [t] = [e], I([t]) = 1 whenever [t] [e]. Therefore, {I([t]) (f* s o F) ([t])} = 1 whenever [t] [e] and {I([t]) (f* s o F) ([t])} = (f* s o F) ([t]) when [t] = [e]. Thus the above equation becomes L (M)(s) = (f* s o F) ([t]) where [t] = [e]. = L(ts) ( by the above result ) = L(es) ( since I[t] = 0 when [t]=[e] and R L is a right invariant relation, [ts] = [es] ) = L(s) Thus for all s all s S, L (s) = L (M) (s). This proves that L = L (M). 3. Implementation The algorithm to compute L(s) = L(M)(s) for any string s of arbitrary length and any fuzzy automata M with any number of states is developed and implemented in C++. Following procedures are used to compute f * (q i, s, q j ) and L(s) for all s S and q i,, q j Q. Procedure MinMax(i,j,X,Y). This procedure computes and returns the min-max composition value of row-i of matrix X and column-j of matrix Y. X and Y are the n x n transition matrices, min, temp and r are temporary variables. 1. min = 2. for r = 0 to n-1 do 2.1 if (X[i][r] Y[r][j]) then temp = X[i][j] else temp = Y[i][j] 2.2 if (min>temp) then min=temp 3. return min Procedure computefstar (s). This procedure computes f* - matrix for the input string s and stores it in n x n matrix A. F0 and F1 are the transition matrices for the input symbols 0 and 1 respectively. The procedure call COPY(X, Y) copies the matrix X to matrix Y. B is the temporary matrix of size n x n. The procedure call computefstar(x, Y, Z) computes the f*- value for each pair (q i, q j ) Q x Q using transition matrices X, Y and stores the result in the matrix Z. 1. if (s[0]= 0 ) then COPY (A, F0) else COPY (A, F1) 2. for i = 1 to (length(s) 1) do if (s[i] = 0 ) computefstar(a, F0, B) else computefstar(a, F1, B) 63
7 else 3. COPY(A, B). 4. Exit V. Ramaswamy and K.Chatrapathy Procedure computefstarcompf(q). This procedure computes and returns (f* s o F)(q) value for a given state q Q. A is the f* s - matrix for the string s. 1. min = 2. for r = 0 to n-1 do 2.1 temp = MAX(A[p][r], F[r]) 2.2 if (temp < min ) then min = temp 3. return min Procedure computels. This procedure computes and returns L(s) value for a given string s. 1. min = 2. for p = 0 to n-1 do 2.1 temp = computefstarcompf( p ) 2.2 if (I [p] > temp ) then temp = I [p] 2.3 if (temp < min ) then min = temp 3. return min Procedure main( ). This procedure inputs the fuzzy automaton M = (Q, f, I, F), computes and returns L(s) value for a given input string s. F0, F1, n are transition matrix for 0, transition matrix 1 and number of states in Q respectively. Fe is the f*-matrix for e. I and F are array of size n. Ls stores the L(s) value of the input string s. 1. read number of states n 2. read arrays I and F 3. set f * e matrix Fe 4. read transition matrices F0, F1 5. ch = y 6. while ( ch = y ) do 6.1 Read input string s 6.2 A = computefstar(s) 6.3 Ls = computels( ) 6.4 Print transition matrix A 6.5 Print Ls 6.6 read input character ch = y to continue, ch = n to stop 7. Exit The program is tested for large number of fuzzy automata and strings of arbitrary length. 4. Example 64
8 Myhill Nerode Theorem for Fuzzy Automata (Min-max Composition) Let Σ = {0, 1} and S = Σ*, the set of all strings over the alphabet Σ. Consider the fuzzy automaton M = (Q, f, I, F) where Q = {q 0, q 1, q 2 }, f is the fuzzy subset f: Q x Σ x Q [0, 1] defined as f (q 0, 0, q 0 ) = 0.0, f (q 0, 0, q 1 ) = 0.8, f (q 0, 0, q 2 ) = 0.6 f (q 1, 0, q 0 ) = 0.5, f (q 1, 0, q 1 ) = 0.0, f (q 1, 0, q 2 ) = 0.7 f (q 2, 0, q 0 ) = 0.3, f (q 2, 0, q 1 ) = 0.6, f (q 2, 0, q 2 ) = 0.0 f (q 0, 1, q 0 ) = 0.0, f (q 0, 1, q 1 ) = 0.6, f (q 0, 1, q 2 ) = 0.7 f (q 1, 1, q 0 ) = 0.5, f (q 1, 1, q 1 ) = 0.0, f (q 1, 1, q 2 ) = 0.8 f (q 2, 1, q 0 ) = 0.4, f (q 2, 1, q 1 ) = 0.2, f (q 2, 1, q 2 ) = 0.0 I = {q 0 } and F is the fuzzy subset of Q defined as F (q 1 ) = 0.4 and F (q 2 ) = 0.9. For any string w = sa of length two or more we will calculate f*(q i, w, q j ) as follows: f * (q, sa, p) = [ f * (q, s, r) f (r, a, p)] (s S, a A, q i, q j Q ) r Q After computing f*-matrix for a given string s, we will compute L(M)(s) as follows: L(M)(s) = I o f 0 * o F = [ I(p) (f s * o F) (p) ] p Q = [ I(q 0 ) (f s * o F) (q 0 ) ] [ I(q 1 ) (f s * o F) (q 1 ) ] [ I(q 2 ) (f s * o F) (q 2 ) ] = (f s * o F) (q 1 ) (f s * o F) (q 2 ) Therefore,for any string s S L(M)(s) = (f s * o F) (q 1 ) (f s * o F) (q 2 ) (11) (f s * o F) (q 1 ) = [F(r) f s *(q 1, r)] r Q = [F(q 0 ) f s *( q 1, q 0 )] [F(q 1 ) f s *( q 1, q 1 )] [F(q 2 ) f s *(q 1, q 2 )] = 0.4 f s *( q 1, q 0 ) [0.9 f s *( q 1, q 2 )] Therefore, for any string s S, (f s * o F) (q 1 ) = 0.4 f s *( q 1, q 0 ) [0.9 f s *( q 1, q 2 )]) (12) (f s * o F) (q 2 ) = [F(r) f s *( q 2,, r)] r Q = [F(q 0 ) f s *( q 2, q 0 )] [F(q 1 ) f s *( q 2, q 1 ) [F(q 2 ) f s *( q 2, q 2 )] = 0.9 f s *( q 2, q 0 )] [0.4 f s *( q 2, q 1 ) ] Therefore for any string s S, (f s * o F) (q 2 ) = 0.9 f s *( q 0, q 2 ) [0.4 f s *( q 1, q 2 ) ] (13) L (0) = L (M)(0) = I o f 0 * o F = (f 0 * o F) (q 1 ) (f 0 * o F) (q 2 ) = {0.4 f 0 *( q 1, q 0 ) [0.9 f 0 *( q 1, q 2 )] } { 0.9 f 0 *( q 2, q 0 ) [0.4 f 0 *( q 2, q 1 )]}= 0.3 Similarly, L(1) = 0.4 f 00 * (q 0, q 0 ) = f* (q 0, 00, q 0 ) = [f (q 0, 0, q 0 ) f (q 0, 0, q 0 )] [f (q 0, 0, q 1 ) f (q 1, 0, q 0 )] [f (q 0, 0, q 2 ) f (q 2, 0, q 0 )] = 0 65
9 V. Ramaswamy and K.Chatrapathy f 00 * (q 0, q 1 ) = f* (q 0, 00, q 0 ) = [f (q 0, 0, q 0 ) f (q 0,0,q 1 )] [f (q 0,0,q 1 ) f (q 1,0,q 1 )] [f (q 0, 0,q 2 ) f (q 2,0,q 1 )] = 0.6 * Similarly, the f - 00 matrix is computed as follows; f 00 * (q 0, q 0 ) = 0 f 00 * (q 0, q 1 ) = 0.6 f 00 * (q 0, q 2 ) = 0.6 f 00 * (q 1, q 0 ) = 0.5 f 00 * (q 1, q 1 ) = 0 f 00 * (q 1, q 2 ) = 0.6 f 00 * (q 2, q 0 ) = 0.3 f 00 * (q 2, q 1 ) = 0.6 f 00 * (q 2, q 2 ) = 0 L(00) = (f 00 * o F) (q 1 ) (f 00 * o F) (q 2 ) = {0.4 f 00 *(q 1,q 0 ) [0.9 f 00 *( q 1,q 2 )] } { 0.9 f 00 *( q 2, q 0 ) [0.4 f 00 *(q 2, q 1 ) ]} = { [ ] } { [ ] } = 0.3 Using the program for the example fuzzy automata, f* s matrix and L(s) values are computed for various strings and the same values are checked using manual calculations. Both manually calculated values and computer results are tallied. Some of the L(s) values are as follows. L(0) = 0.3, L(1)=0.4, L(00)=L(01)=L(10)=0.3, L(11 ) = 0.4, L(000)=L(001)=... L(110) = 0.3, L(111) = 0.4, L(0000)=...L(1110)=0.3,L(1111)=0.4, L( )=0.3, L( )=0.3, L( )=0.3, L( )=0.3, L( )=0.3, L( )=0.3, L( )=0.3, L( )=0.4, L( )=0.4. It is found that L(s)=0.4 only when every symbol in s is 1. Otherwise, L(s)=0.3. The possible values of δ i (after arranging them in nondecreasing order) are 0.3, 0.4. Suppose 0 < α 0.3. Let D α (M) = M α denote the nondeterministic automaton corresponding to α. Then I α = { q 0 }, F α = { q1, q2 }, d α (q 0, s) = { p Q / f 0 * (q 0, s) 0.3 } = {q 1, q 2 } L (D α (M)) = {s S / there exists q I α such that (d α (q, s) F α) φ} = {s S / there exists q I 0.3 such that (d 0.3 (q, s) F 0.3) φ} = {0, 1} + L α = {s S / L(s) α} = {s S / L(s) 0.3} = {0,1} + L (D α (M)) = L α. Furthermore, [0] α = {0, 01, 10, 000, 001, 010, 110, 0000, 1110, 00000, } [1] α = { 1, 11, 111, 1111,..} L α = [s] α = [0] α [1] α. Suppose 0.3 < α 0.4. Let D α (M) = M α denote the nondeterministic automaton corresponding to α. Then I α = { q 0 }, F α = { q1, q2 }, d α (q 0, s) = { p Q / f 0 * (q 0, s) 0.4 } = {q1, q2} L (D α (M)) = {s S / there exists q I α such that (d α (q, s) F α) φ} = {s S / there exists q I 0.4 such that (d 0.4 (q, s) F 0.4) φ} = {0, 1} + L α = {s S / L(s) α} 66
10 Myhill Nerode Theorem for Fuzzy Automata (Min-max Composition) = {s S / L(s) 0.4} = {1} + L (D α(m)) L α. and also L α L (D α (M)). Furthermore, [1] α = {1, 11, 111, 1111 } L α = [ s ] α = [1] α. If α > 0.4, then there exists no corresponding nondeterministic automaton and L (D α (M)) = L α = φ. When α = 0.3 α L (s) = α if L(s) α, 0 otherwise. α L (0) = α L (00) = α L (01) = α L (10) = α L (000) = α L (110) = α L (0000) = α L (1110) =.. = 0.3 α L (1) = α L (11) = α L (111) = α L (1111) = α L ( ) = 0 When α = 0.4 α L (s) = α if L(s) α, 0 otherwise. α L (0) = α L (00) = α L (01) = α L (10) = α L (000) = α L (110) = α L (0000) = α L (1110) = 0 α L (1) = α L (11) = α L (111) = α L (1111) = α L ( ) = 0.4 L = α L where denotes fuzzy union. α [0, 1] ( α L ) (0) = α L (0) = = 0.3 = L(0) ( α L ) (1) = α L (1) = = 0.4 = L(1) Similarly, ( α L ) (s) = α L (s) = = 0.3 = L(s) for all s S. This verifies L = α L 5. Results and Conclusions In this paper, Myhill Nerode theorem of finite automaton has been extended to fuzzy automaton where the composition considered is min-max composition. The algorithm to compute f*(q i, s, q j ) and L(s) is developed and implemented in C++. The program is tested with different fuzzy automata and strings of different lengths. In min-max composition, it is found that L α need not even be contained in L (D α (M)). Anyway, we have been able to prove the analogue of Myhill Nerode Theorem for fuzzy automata even for min-max composition. REFERENCES 1. Jiri Mockr, Fuzzy and non-deterministic automata, Research Report No. 8, University of Ostrava, Czech Republic, V. Ramaswamy and H.A. Girijamma, An extension of Myhill Nerode theorem for fuzzy automata, Advances in Fuzzy Mathematics, 4(1) (2009) V. Ramaswamy and H.A. Girijamma, Characterization of fuzzy regular languages, Intern. J. Computer Science and Network Security, 8(12) (2008) W.Cheng and Z.-W.Mo, Minimization algorithm of fuzzy finite automata, Fuzzy Sets and Systems, 141 (2004) J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley Publishing, Reading, MA, Vivek Raich, Archana Gawande and Seema Modi, Fuzzy matrix solution for the study of teacher s evaluation, Intern. J. Fuzzy Mathematical Archive, 3 (2013) J.Boobalan and S.Sriram, The semi inverse of max-min product of fuzzy matrices, Intern. J. Fuzzy Mathematical Archive, 3 (2013)
Homomorphism in Intuitionistic Fuzzy Automata
International Journal of Fuzzy Mathematics Systems. ISSN 2248-9940 Volume 3, Number 1 (2013), pp. 39-45 Research India Publications http://www.ripublication.com/ijfms.htm Homomorphism in Intuitionistic
Διαβάστε περισσότερα2 Composition. Invertible Mappings
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan Composition. Invertible Mappings In this section we discuss two procedures for creating new mappings from old ones, namely,
Διαβάστε περισσότεραA Note on Intuitionistic Fuzzy. Equivalence Relation
International Mathematical Forum, 5, 2010, no. 67, 3301-3307 A Note on Intuitionistic Fuzzy Equivalence Relation D. K. Basnet Dept. of Mathematics, Assam University Silchar-788011, Assam, India dkbasnet@rediffmail.com
Διαβάστε περισσότεραOrdinal Arithmetic: Addition, Multiplication, Exponentiation and Limit
Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit Ting Zhang Stanford May 11, 2001 Stanford, 5/11/2001 1 Outline Ordinal Classification Ordinal Addition Ordinal Multiplication Ordinal
Διαβάστε περισσότεραEvery set of first-order formulas is equivalent to an independent set
Every set of first-order formulas is equivalent to an independent set May 6, 2008 Abstract A set of first-order formulas, whatever the cardinality of the set of symbols, is equivalent to an independent
Διαβάστε περισσότεραCongruence Classes of Invertible Matrices of Order 3 over F 2
International Journal of Algebra, Vol. 8, 24, no. 5, 239-246 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.2988/ija.24.422 Congruence Classes of Invertible Matrices of Order 3 over F 2 Ligong An and
Διαβάστε περισσότεραCommutative Monoids in Intuitionistic Fuzzy Sets
Commutative Monoids in Intuitionistic Fuzzy Sets S K Mala #1, Dr. MM Shanmugapriya *2 1 PhD Scholar in Mathematics, Karpagam University, Coimbatore, Tamilnadu- 641021 Assistant Professor of Mathematics,
Διαβάστε περισσότεραC.S. 430 Assignment 6, Sample Solutions
C.S. 430 Assignment 6, Sample Solutions Paul Liu November 15, 2007 Note that these are sample solutions only; in many cases there were many acceptable answers. 1 Reynolds Problem 10.1 1.1 Normal-order
Διαβάστε περισσότεραHOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch:
HOMEWORK 4 Problem a For the fast loading case, we want to derive the relationship between P zz and λ z. We know that the nominal stress is expressed as: P zz = ψ λ z where λ z = λ λ z. Therefore, applying
Διαβάστε περισσότεραExample Sheet 3 Solutions
Example Sheet 3 Solutions. i Regular Sturm-Liouville. ii Singular Sturm-Liouville mixed boundary conditions. iii Not Sturm-Liouville ODE is not in Sturm-Liouville form. iv Regular Sturm-Liouville note
Διαβάστε περισσότεραEE512: Error Control Coding
EE512: Error Control Coding Solution for Assignment on Finite Fields February 16, 2007 1. (a) Addition and Multiplication tables for GF (5) and GF (7) are shown in Tables 1 and 2. + 0 1 2 3 4 0 0 1 2 3
Διαβάστε περισσότεραFinite Field Problems: Solutions
Finite Field Problems: Solutions 1. Let f = x 2 +1 Z 11 [x] and let F = Z 11 [x]/(f), a field. Let Solution: F =11 2 = 121, so F = 121 1 = 120. The possible orders are the divisors of 120. Solution: The
Διαβάστε περισσότεραLecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3
Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3 1 State vector space and the dual space Space of wavefunctions The space of wavefunctions is the set of all
Διαβάστε περισσότεραST5224: Advanced Statistical Theory II
ST5224: Advanced Statistical Theory II 2014/2015: Semester II Tutorial 7 1. Let X be a sample from a population P and consider testing hypotheses H 0 : P = P 0 versus H 1 : P = P 1, where P j is a known
Διαβάστε περισσότεραOther Test Constructions: Likelihood Ratio & Bayes Tests
Other Test Constructions: Likelihood Ratio & Bayes Tests Side-Note: So far we have seen a few approaches for creating tests such as Neyman-Pearson Lemma ( most powerful tests of H 0 : θ = θ 0 vs H 1 :
Διαβάστε περισσότεραFractional Colorings and Zykov Products of graphs
Fractional Colorings and Zykov Products of graphs Who? Nichole Schimanski When? July 27, 2011 Graphs A graph, G, consists of a vertex set, V (G), and an edge set, E(G). V (G) is any finite set E(G) is
Διαβάστε περισσότεραThe challenges of non-stable predicates
The challenges of non-stable predicates Consider a non-stable predicate Φ encoding, say, a safety property. We want to determine whether Φ holds for our program. The challenges of non-stable predicates
Διαβάστε περισσότεραderivation of the Laplacian from rectangular to spherical coordinates
derivation of the Laplacian from rectangular to spherical coordinates swapnizzle 03-03- :5:43 We begin by recognizing the familiar conversion from rectangular to spherical coordinates (note that φ is used
Διαβάστε περισσότερα4.6 Autoregressive Moving Average Model ARMA(1,1)
84 CHAPTER 4. STATIONARY TS MODELS 4.6 Autoregressive Moving Average Model ARMA(,) This section is an introduction to a wide class of models ARMA(p,q) which we will consider in more detail later in this
Διαβάστε περισσότεραMINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS
MINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS FUMIE NAKAOKA AND NOBUYUKI ODA Received 20 December 2005; Revised 28 May 2006; Accepted 6 August 2006 Some properties of minimal closed sets and maximal closed
Διαβάστε περισσότεραThe Simply Typed Lambda Calculus
Type Inference Instead of writing type annotations, can we use an algorithm to infer what the type annotations should be? That depends on the type system. For simple type systems the answer is yes, and
Διαβάστε περισσότεραHomework 3 Solutions
Homework 3 Solutions Igor Yanovsky (Math 151A TA) Problem 1: Compute the absolute error and relative error in approximations of p by p. (Use calculator!) a) p π, p 22/7; b) p π, p 3.141. Solution: For
Διαβάστε περισσότεραSection 8.3 Trigonometric Equations
99 Section 8. Trigonometric Equations Objective 1: Solve Equations Involving One Trigonometric Function. In this section and the next, we will exple how to solving equations involving trigonometric functions.
Διαβάστε περισσότεραNowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in
Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in : tail in X, head in A nowhere-zero Γ-flow is a Γ-circulation such that
Διαβάστε περισσότερα6.3 Forecasting ARMA processes
122 CHAPTER 6. ARMA MODELS 6.3 Forecasting ARMA processes The purpose of forecasting is to predict future values of a TS based on the data collected to the present. In this section we will discuss a linear
Διαβάστε περισσότεραSCHOOL OF MATHEMATICAL SCIENCES G11LMA Linear Mathematics Examination Solutions
SCHOOL OF MATHEMATICAL SCIENCES GLMA Linear Mathematics 00- Examination Solutions. (a) i. ( + 5i)( i) = (6 + 5) + (5 )i = + i. Real part is, imaginary part is. (b) ii. + 5i i ( + 5i)( + i) = ( i)( + i)
Διαβάστε περισσότερα6.1. Dirac Equation. Hamiltonian. Dirac Eq.
6.1. Dirac Equation Ref: M.Kaku, Quantum Field Theory, Oxford Univ Press (1993) η μν = η μν = diag(1, -1, -1, -1) p 0 = p 0 p = p i = -p i p μ p μ = p 0 p 0 + p i p i = E c 2 - p 2 = (m c) 2 H = c p 2
Διαβάστε περισσότεραUniform Convergence of Fourier Series Michael Taylor
Uniform Convergence of Fourier Series Michael Taylor Given f L 1 T 1 ), we consider the partial sums of the Fourier series of f: N 1) S N fθ) = ˆfk)e ikθ. k= N A calculation gives the Dirichlet formula
Διαβάστε περισσότεραMatrices and Determinants
Matrices and Determinants SUBJECTIVE PROBLEMS: Q 1. For what value of k do the following system of equations possess a non-trivial (i.e., not all zero) solution over the set of rationals Q? x + ky + 3z
Διαβάστε περισσότεραReminders: linear functions
Reminders: linear functions Let U and V be vector spaces over the same field F. Definition A function f : U V is linear if for every u 1, u 2 U, f (u 1 + u 2 ) = f (u 1 ) + f (u 2 ), and for every u U
Διαβάστε περισσότεραStatistical Inference I Locally most powerful tests
Statistical Inference I Locally most powerful tests Shirsendu Mukherjee Department of Statistics, Asutosh College, Kolkata, India. shirsendu st@yahoo.co.in So far we have treated the testing of one-sided
Διαβάστε περισσότεραApproximation of distance between locations on earth given by latitude and longitude
Approximation of distance between locations on earth given by latitude and longitude Jan Behrens 2012-12-31 In this paper we shall provide a method to approximate distances between two points on earth
Διαβάστε περισσότεραMath221: HW# 1 solutions
Math: HW# solutions Andy Royston October, 5 7.5.7, 3 rd Ed. We have a n = b n = a = fxdx = xdx =, x cos nxdx = x sin nx n sin nxdx n = cos nx n = n n, x sin nxdx = x cos nx n + cos nxdx n cos n = + sin
Διαβάστε περισσότερα1. Introduction and Preliminaries.
Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.yu/filomat Filomat 22:1 (2008), 97 106 ON δ SETS IN γ SPACES V. Renuka Devi and D. Sivaraj Abstract We
Διαβάστε περισσότεραk A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R +
Chapter 3. Fuzzy Arithmetic 3- Fuzzy arithmetic: ~Addition(+) and subtraction (-): Let A = [a and B = [b, b in R If x [a and y [b, b than x+y [a +b +b Symbolically,we write A(+)B = [a (+)[b, b = [a +b
Διαβάστε περισσότεραSome new generalized topologies via hereditary classes. Key Words:hereditary generalized topological space, A κ(h,µ)-sets, κµ -topology.
Bol. Soc. Paran. Mat. (3s.) v. 30 2 (2012): 71 77. c SPM ISSN-2175-1188 on line ISSN-00378712 in press SPM: www.spm.uem.br/bspm doi:10.5269/bspm.v30i2.13793 Some new generalized topologies via hereditary
Διαβάστε περισσότεραTridiagonal matrices. Gérard MEURANT. October, 2008
Tridiagonal matrices Gérard MEURANT October, 2008 1 Similarity 2 Cholesy factorizations 3 Eigenvalues 4 Inverse Similarity Let α 1 ω 1 β 1 α 2 ω 2 T =......... β 2 α 1 ω 1 β 1 α and β i ω i, i = 1,...,
Διαβάστε περισσότεραPhys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required)
Phys460.nb 81 ψ n (t) is still the (same) eigenstate of H But for tdependent H. The answer is NO. 5.5.5. Solution for the tdependent Schrodinger s equation If we assume that at time t 0, the electron starts
Διαβάστε περισσότεραConcrete Mathematics Exercises from 30 September 2016
Concrete Mathematics Exercises from 30 September 2016 Silvio Capobianco Exercise 1.7 Let H(n) = J(n + 1) J(n). Equation (1.8) tells us that H(2n) = 2, and H(2n+1) = J(2n+2) J(2n+1) = (2J(n+1) 1) (2J(n)+1)
Διαβάστε περισσότεραSOME PROPERTIES OF FUZZY REAL NUMBERS
Sahand Communications in Mathematical Analysis (SCMA) Vol. 3 No. 1 (2016), 21-27 http://scma.maragheh.ac.ir SOME PROPERTIES OF FUZZY REAL NUMBERS BAYAZ DARABY 1 AND JAVAD JAFARI 2 Abstract. In the mathematical
Διαβάστε περισσότεραORDINAL ARITHMETIC JULIAN J. SCHLÖDER
ORDINAL ARITHMETIC JULIAN J. SCHLÖDER Abstract. We define ordinal arithmetic and show laws of Left- Monotonicity, Associativity, Distributivity, some minor related properties and the Cantor Normal Form.
Διαβάστε περισσότεραCHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS
CHAPTER 5 SOLVING EQUATIONS BY ITERATIVE METHODS EXERCISE 104 Page 8 1. Find the positive root of the equation x + 3x 5 = 0, correct to 3 significant figures, using the method of bisection. Let f(x) =
Διαβάστε περισσότεραOverview. Transition Semantics. Configurations and the transition relation. Executions and computation
Overview Transition Semantics Configurations and the transition relation Executions and computation Inference rules for small-step structural operational semantics for the simple imperative language Transition
Διαβάστε περισσότεραMath 446 Homework 3 Solutions. (1). (i): Reverse triangle inequality for metrics: Let (X, d) be a metric space and let x, y, z X.
Math 446 Homework 3 Solutions. (1). (i): Reverse triangle inequalit for metrics: Let (X, d) be a metric space and let x,, z X. Prove that d(x, z) d(, z) d(x, ). (ii): Reverse triangle inequalit for norms:
Διαβάστε περισσότερα2. Let H 1 and H 2 be Hilbert spaces and let T : H 1 H 2 be a bounded linear operator. Prove that [T (H 1 )] = N (T ). (6p)
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 2005-03-08 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
Διαβάστε περισσότεραLecture 2. Soundness and completeness of propositional logic
Lecture 2 Soundness and completeness of propositional logic February 9, 2004 1 Overview Review of natural deduction. Soundness and completeness. Semantics of propositional formulas. Soundness proof. Completeness
Διαβάστε περισσότεραMINIMAL INTUITIONISTIC GENERAL L-FUZZY AUTOMATA
italian journal of pure applied mathematics n. 35 2015 (155 186) 155 MINIMAL INTUITIONISTIC GENERAL L-UZZY AUTOMATA M. Shamsizadeh M.M. Zahedi Department of Mathematics Kerman Graduate University of Advanced
Διαβάστε περισσότεραGenerating Set of the Complete Semigroups of Binary Relations
Applied Mathematics 06 7 98-07 Published Online January 06 in SciRes http://wwwscirporg/journal/am http://dxdoiorg/036/am067009 Generating Set of the Complete Semigroups of Binary Relations Yasha iasamidze
Διαβάστε περισσότεραChapter 6: Systems of Linear Differential. be continuous functions on the interval
Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations
Διαβάστε περισσότεραLecture 15 - Root System Axiomatics
Lecture 15 - Root System Axiomatics Nov 1, 01 In this lecture we examine root systems from an axiomatic point of view. 1 Reflections If v R n, then it determines a hyperplane, denoted P v, through the
Διαβάστε περισσότεραSCITECH Volume 13, Issue 2 RESEARCH ORGANISATION Published online: March 29, 2018
Journal of rogressive Research in Mathematics(JRM) ISSN: 2395-028 SCITECH Volume 3, Issue 2 RESEARCH ORGANISATION ublished online: March 29, 208 Journal of rogressive Research in Mathematics www.scitecresearch.com/journals
Διαβάστε περισσότεραDIRECT PRODUCT AND WREATH PRODUCT OF TRANSFORMATION SEMIGROUPS
GANIT J. Bangladesh Math. oc. IN 606-694) 0) -7 DIRECT PRODUCT AND WREATH PRODUCT OF TRANFORMATION EMIGROUP ubrata Majumdar, * Kalyan Kumar Dey and Mohd. Altab Hossain Department of Mathematics University
Διαβάστε περισσότεραHomomorphism of Intuitionistic Fuzzy Groups
International Mathematical Forum, Vol. 6, 20, no. 64, 369-378 Homomorphism o Intuitionistic Fuzz Groups P. K. Sharma Department o Mathematics, D..V. College Jalandhar Cit, Punjab, India pksharma@davjalandhar.com
Διαβάστε περισσότεραΑπόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ.
Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο The time integral of a force is referred to as impulse, is determined by and is obtained from: Newton s 2 nd Law of motion states that the action
Διαβάστε περισσότεραCoefficient Inequalities for a New Subclass of K-uniformly Convex Functions
International Journal of Computational Science and Mathematics. ISSN 0974-89 Volume, Number (00), pp. 67--75 International Research Publication House http://www.irphouse.com Coefficient Inequalities for
Διαβάστε περισσότεραInverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- -----------------
Inverse trigonometric functions & General Solution of Trigonometric Equations. 1. Sin ( ) = a) b) c) d) Ans b. Solution : Method 1. Ans a: 17 > 1 a) is rejected. w.k.t Sin ( sin ) = d is rejected. If sin
Διαβάστε περισσότεραOn a four-dimensional hyperbolic manifold with finite volume
BULETINUL ACADEMIEI DE ŞTIINŢE A REPUBLICII MOLDOVA. MATEMATICA Numbers 2(72) 3(73), 2013, Pages 80 89 ISSN 1024 7696 On a four-dimensional hyperbolic manifold with finite volume I.S.Gutsul Abstract. In
Διαβάστε περισσότεραProblem Set 3: Solutions
CMPSCI 69GG Applied Information Theory Fall 006 Problem Set 3: Solutions. [Cover and Thomas 7.] a Define the following notation, C I p xx; Y max X; Y C I p xx; Ỹ max I X; Ỹ We would like to show that C
Διαβάστε περισσότεραJesse Maassen and Mark Lundstrom Purdue University November 25, 2013
Notes on Average Scattering imes and Hall Factors Jesse Maassen and Mar Lundstrom Purdue University November 5, 13 I. Introduction 1 II. Solution of the BE 1 III. Exercises: Woring out average scattering
Διαβάστε περισσότεραSequent Calculi for the Modal µ-calculus over S5. Luca Alberucci, University of Berne. Logic Colloquium Berne, July 4th 2008
Sequent Calculi for the Modal µ-calculus over S5 Luca Alberucci, University of Berne Logic Colloquium Berne, July 4th 2008 Introduction Koz: Axiomatisation for the modal µ-calculus over K Axioms: All classical
Διαβάστε περισσότεραω ω ω ω ω ω+2 ω ω+2 + ω ω ω ω+2 + ω ω+1 ω ω+2 2 ω ω ω ω ω ω ω ω+1 ω ω2 ω ω2 + ω ω ω2 + ω ω ω ω2 + ω ω+1 ω ω2 + ω ω+1 + ω ω ω ω2 + ω
0 1 2 3 4 5 6 ω ω + 1 ω + 2 ω + 3 ω + 4 ω2 ω2 + 1 ω2 + 2 ω2 + 3 ω3 ω3 + 1 ω3 + 2 ω4 ω4 + 1 ω5 ω 2 ω 2 + 1 ω 2 + 2 ω 2 + ω ω 2 + ω + 1 ω 2 + ω2 ω 2 2 ω 2 2 + 1 ω 2 2 + ω ω 2 3 ω 3 ω 3 + 1 ω 3 + ω ω 3 +
Διαβάστε περισσότεραw o = R 1 p. (1) R = p =. = 1
Πανεπιστήµιο Κρήτης - Τµήµα Επιστήµης Υπολογιστών ΗΥ-570: Στατιστική Επεξεργασία Σήµατος 205 ιδάσκων : Α. Μουχτάρης Τριτη Σειρά Ασκήσεων Λύσεις Ασκηση 3. 5.2 (a) From the Wiener-Hopf equation we have:
Διαβάστε περισσότερα3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β
3.4 SUM AND DIFFERENCE FORMULAS Page Theorem cos(αβ cos α cos β -sin α cos(α-β cos α cos β sin α NOTE: cos(αβ cos α cos β cos(α-β cos α -cos β Proof of cos(α-β cos α cos β sin α Let s use a unit circle
Διαβάστε περισσότεραFourier Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics
Fourier Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Introduction Not all functions can be represented by Taylor series. f (k) (c) A Taylor series f (x) = (x c)
Διαβάστε περισσότεραChapter 3: Ordinal Numbers
Chapter 3: Ordinal Numbers There are two kinds of number.. Ordinal numbers (0th), st, 2nd, 3rd, 4th, 5th,..., ω, ω +,... ω2, ω2+,... ω 2... answers to the question What position is... in a sequence? What
Διαβάστε περισσότεραANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =?
Teko Classes IITJEE/AIEEE Maths by SUHAAG SIR, Bhopal, Ph (0755) 3 00 000 www.tekoclasses.com ANSWERSHEET (TOPIC DIFFERENTIAL CALCULUS) COLLECTION # Question Type A.Single Correct Type Q. (A) Sol least
Διαβάστε περισσότεραSpace-Time Symmetries
Chapter Space-Time Symmetries In classical fiel theory any continuous symmetry of the action generates a conserve current by Noether's proceure. If the Lagrangian is not invariant but only shifts by a
Διαβάστε περισσότεραExample of the Baum-Welch Algorithm
Example of the Baum-Welch Algorithm Larry Moss Q520, Spring 2008 1 Our corpus c We start with a very simple corpus. We take the set Y of unanalyzed words to be {ABBA, BAB}, and c to be given by c(abba)
Διαβάστε περισσότεραSrednicki Chapter 55
Srednicki Chapter 55 QFT Problems & Solutions A. George August 3, 03 Srednicki 55.. Use equations 55.3-55.0 and A i, A j ] = Π i, Π j ] = 0 (at equal times) to verify equations 55.-55.3. This is our third
Διαβάστε περισσότεραChap. 6 Pushdown Automata
Chap. 6 Pushdown Automata 6.1 Definition of Pushdown Automata Example 6.1 L = {wcw R w (0+1) * } P c 0P0 1P1 1. Start at state q 0, push input symbol onto stack, and stay in q 0. 2. If input symbol is
Διαβάστε περισσότερα5. Choice under Uncertainty
5. Choice under Uncertainty Daisuke Oyama Microeconomics I May 23, 2018 Formulations von Neumann-Morgenstern (1944/1947) X: Set of prizes Π: Set of probability distributions on X : Preference relation
Διαβάστε περισσότεραPartial Differential Equations in Biology The boundary element method. March 26, 2013
The boundary element method March 26, 203 Introduction and notation The problem: u = f in D R d u = ϕ in Γ D u n = g on Γ N, where D = Γ D Γ N, Γ D Γ N = (possibly, Γ D = [Neumann problem] or Γ N = [Dirichlet
Διαβάστε περισσότεραNew bounds for spherical two-distance sets and equiangular lines
New bounds for spherical two-distance sets and equiangular lines Michigan State University Oct 8-31, 016 Anhui University Definition If X = {x 1, x,, x N } S n 1 (unit sphere in R n ) and x i, x j = a
Διαβάστε περισσότεραF A S C I C U L I M A T H E M A T I C I
F A S C I C U L I M A T H E M A T I C I Nr 46 2011 C. Carpintero, N. Rajesh and E. Rosas ON A CLASS OF (γ, γ )-PREOPEN SETS IN A TOPOLOGICAL SPACE Abstract. In this paper we have introduced the concept
Διαβάστε περισσότεραParametrized Surfaces
Parametrized Surfaces Recall from our unit on vector-valued functions at the beginning of the semester that an R 3 -valued function c(t) in one parameter is a mapping of the form c : I R 3 where I is some
Διαβάστε περισσότεραPractice Exam 2. Conceptual Questions. 1. State a Basic identity and then verify it. (a) Identity: Solution: One identity is csc(θ) = 1
Conceptual Questions. State a Basic identity and then verify it. a) Identity: Solution: One identity is cscθ) = sinθ) Practice Exam b) Verification: Solution: Given the point of intersection x, y) of the
Διαβάστε περισσότεραCRASH COURSE IN PRECALCULUS
CRASH COURSE IN PRECALCULUS Shiah-Sen Wang The graphs are prepared by Chien-Lun Lai Based on : Precalculus: Mathematics for Calculus by J. Stuwart, L. Redin & S. Watson, 6th edition, 01, Brooks/Cole Chapter
Διαβάστε περισσότεραA Bonus-Malus System as a Markov Set-Chain. Małgorzata Niemiec Warsaw School of Economics Institute of Econometrics
A Bonus-Malus System as a Markov Set-Chain Małgorzata Niemiec Warsaw School of Economics Institute of Econometrics Contents 1. Markov set-chain 2. Model of bonus-malus system 3. Example 4. Conclusions
Διαβάστε περισσότεραIntuitionistic Fuzzy Ideals of Near Rings
International Mathematical Forum, Vol. 7, 202, no. 6, 769-776 Intuitionistic Fuzzy Ideals of Near Rings P. K. Sharma P.G. Department of Mathematics D.A.V. College Jalandhar city, Punjab, India pksharma@davjalandhar.com
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 6/5/2006
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Ολοι οι αριθμοί που αναφέρονται σε όλα τα ερωτήματα είναι μικρότεροι το 1000 εκτός αν ορίζεται διαφορετικά στη διατύπωση του προβλήματος. Διάρκεια: 3,5 ώρες Καλή
Διαβάστε περισσότερα12. Radon-Nikodym Theorem
Tutorial 12: Radon-Nikodym Theorem 1 12. Radon-Nikodym Theorem In the following, (Ω, F) is an arbitrary measurable space. Definition 96 Let μ and ν be two (possibly complex) measures on (Ω, F). We say
Διαβάστε περισσότεραLecture 13 - Root Space Decomposition II
Lecture 13 - Root Space Decomposition II October 18, 2012 1 Review First let us recall the situation. Let g be a simple algebra, with maximal toral subalgebra h (which we are calling a CSA, or Cartan Subalgebra).
Διαβάστε περισσότεραSolution Series 9. i=1 x i and i=1 x i.
Lecturer: Prof. Dr. Mete SONER Coordinator: Yilin WANG Solution Series 9 Q1. Let α, β >, the p.d.f. of a beta distribution with parameters α and β is { Γ(α+β) Γ(α)Γ(β) f(x α, β) xα 1 (1 x) β 1 for < x
Διαβάστε περισσότεραSecond Order RLC Filters
ECEN 60 Circuits/Electronics Spring 007-0-07 P. Mathys Second Order RLC Filters RLC Lowpass Filter A passive RLC lowpass filter (LPF) circuit is shown in the following schematic. R L C v O (t) Using phasor
Διαβάστε περισσότεραAreas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Διαβάστε περισσότεραCyclic or elementary abelian Covers of K 4
Cyclic or elementary abelian Covers of K 4 Yan-Quan Feng Mathematics, Beijing Jiaotong University Beijing 100044, P.R. China Summer School, Rogla, Slovenian 2011-06 Outline 1 Question 2 Main results 3
Διαβάστε περισσότεραSection 7.6 Double and Half Angle Formulas
09 Section 7. Double and Half Angle Fmulas To derive the double-angles fmulas, we will use the sum of two angles fmulas that we developed in the last section. We will let α θ and β θ: cos(θ) cos(θ + θ)
Διαβάστε περισσότεραAreas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Διαβάστε περισσότεραA Note on Characterization of Intuitionistic Fuzzy Ideals in Γ- Near-Rings
International Journal of Computational Science and Mathematics. ISSN 0974-3189 Volume 3, Number 1 (2011), pp. 61-71 International Research Publication House http://www.irphouse.com A Note on Characterization
Διαβάστε περισσότεραExercises 10. Find a fundamental matrix of the given system of equations. Also find the fundamental matrix Φ(t) satisfying Φ(0) = I. 1.
Exercises 0 More exercises are available in Elementary Differential Equations. If you have a problem to solve any of them, feel free to come to office hour. Problem Find a fundamental matrix of the given
Διαβάστε περισσότεραSOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM
SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM Solutions to Question 1 a) The cumulative distribution function of T conditional on N n is Pr T t N n) Pr max X 1,..., X N ) t N n) Pr max
Διαβάστε περισσότεραBounding Nonsplitting Enumeration Degrees
Bounding Nonsplitting Enumeration Degrees Thomas F. Kent Andrea Sorbi Università degli Studi di Siena Italia July 18, 2007 Goal: Introduce a form of Σ 0 2-permitting for the enumeration degrees. Till now,
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Αν κάπου κάνετε κάποιες υποθέσεις να αναφερθούν στη σχετική ερώτηση. Όλα τα αρχεία που αναφέρονται στα προβλήματα βρίσκονται στον ίδιο φάκελο με το εκτελέσιμο
Διαβάστε περισσότεραMATH423 String Theory Solutions 4. = 0 τ = f(s). (1) dτ ds = dxµ dτ f (s) (2) dτ 2 [f (s)] 2 + dxµ. dτ f (s) (3)
1. MATH43 String Theory Solutions 4 x = 0 τ = fs). 1) = = f s) ) x = x [f s)] + f s) 3) equation of motion is x = 0 if an only if f s) = 0 i.e. fs) = As + B with A, B constants. i.e. allowe reparametrisations
Διαβάστε περισσότεραEcon 2110: Fall 2008 Suggested Solutions to Problem Set 8 questions or comments to Dan Fetter 1
Eon : Fall 8 Suggested Solutions to Problem Set 8 Email questions or omments to Dan Fetter Problem. Let X be a salar with density f(x, θ) (θx + θ) [ x ] with θ. (a) Find the most powerful level α test
Διαβάστε περισσότεραSolutions to Exercise Sheet 5
Solutions to Eercise Sheet 5 jacques@ucsd.edu. Let X and Y be random variables with joint pdf f(, y) = 3y( + y) where and y. Determine each of the following probabilities. Solutions. a. P (X ). b. P (X
Διαβάστε περισσότεραProblem Set 9 Solutions. θ + 1. θ 2 + cotθ ( ) sinθ e iφ is an eigenfunction of the ˆ L 2 operator. / θ 2. φ 2. sin 2 θ φ 2. ( ) = e iφ. = e iφ cosθ.
Chemistry 362 Dr Jean M Standard Problem Set 9 Solutions The ˆ L 2 operator is defined as Verify that the angular wavefunction Y θ,φ) Also verify that the eigenvalue is given by 2! 2 & L ˆ 2! 2 2 θ 2 +
Διαβάστε περισσότεραSOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM
SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM Solutions to Question 1 a) The cumulative distribution function of T conditional on N n is Pr (T t N n) Pr (max (X 1,..., X N ) t N n) Pr (max
Διαβάστε περισσότεραStrain gauge and rosettes
Strain gauge and rosettes Introduction A strain gauge is a device which is used to measure strain (deformation) on an object subjected to forces. Strain can be measured using various types of devices classified
Διαβάστε περισσότεραHomomorphism and Cartesian Product on Fuzzy Translation and Fuzzy Multiplication of PS-algebras
Annals of Pure and Applied athematics Vol. 8, No. 1, 2014, 93-104 ISSN: 2279-087X (P), 2279-0888(online) Published on 11 November 2014 www.researchmathsci.org Annals of Homomorphism and Cartesian Product
Διαβάστε περισσότερα