γ-synchronized fuzzy automata and their applications V. Karthikeyan, M. Rajasekar
|
|
- Felicia Hood
- 5 years ago
- Views:
Transcription
1 Annals of Fuzzy Mathematics and Informatics Volume 10, No. 2, (August 2015), pp ISSN: (print version) ISSN: (electronic version) c Kyung Moon Sa Co. γ-synchronized fuzzy automata and their applications V. Karthikeyan, M. Rajasekar Received 16 April 2014; Revised 24 November 2014; Accepted 3 December 2014 Abstract. γ-synchronized fuzzy automaton were introduced by V. Karthikeyan and M. Rajasekar in [5]. In this paper we introduce γ- synchronization degree of a fuzzy automaton and procedure is given to find γ-synchronized words. Using this concept, we introduce an application related to petrol passing through two different pipelines in 4 cities. The objective is to find shortest optimum sequence of pipelines to cover all cities (we can start anywhere in 4 cities) such that the petrol reaches each city at least once and ends in a particular city with minimal flow capacity and minimum maintenance cost AMS Classification: 18B20, 68Q70 Keywords: automaton. Corresponding Author: Stability relation, γ-synchronized fuzzy automaton, Quotient fuzzy V. Karthikeyan (vkarthikau@gmail.com) 1. INTRODUCTION The concept of fuzzy set was introduced by L. A. Zadeh in 1965 [7]. The mathematical formulation of a fuzzy automaton was first proposed by W.G. Wee in 1967 [6]. γ-synchronized fuzzy automaton were introduced by V. Karthikeyan and M. Rajasekar in [5]. In this paper, we introduce γ-synchronization degree of a fuzzy automaton and procedure is given to find γ-synchronized words. Using this concept, we introduce an application related to petrol passing through two different pipelines in n cities. Flow capacity of the pipelines is given. Each pair of city is connected by pipelines with one other. Let C ij be the maintenance cost for the pipeline that connects from i th city to j th city. The objective is to find the shortest optimum sequence of pipelines to cover all cities (we can start anywhere in n cities) such that the petrol reaches each city at least once and ends in a particular city with minimal flow capacity and minimum maintenance cost.
2 V. Karthikeyan et al. /Ann. Fuzzy Math. Inform. 10 (2015), No. 2, Preliminaries Definition 2.1 ([8]). Let X denote a universal set. Then a fuzzy set A in X is set of ordered pairs: A = {(x, µ A (x) x X}, µ A (x) is called the membership function or grade of membership of x in A which maps X to the membership space [0, 1]. Definition 2.2 ([4]). A finite fuzzy automaton is a system of 5 tuples, M = (Q, Σ f M, q 0, F ), where, Q - set of states {q 0,,,..., q n }, Σ - alphabets (or) input symbols, f M - function from Q Σ Q [0, 1], q 0 initial state and q 0 Q, and F Q set of final states. f M (q i, a, q j ) = µ, 0 µ 1, means that when M is in state q i and reads the input a will move to the state q j with weight function µ. f M can be extended to Q Σ Q [0, 1] by, { 1 if q i = q j f M (q i, ϵ, q j ) = 0 if q i q j f M (q i, w, q m ) = Max{Min{f M (q i, a 1, ), f M (, a 2, ),..., f M (q m 1, a m, q m )}} for w = a 1 a 2 a 3... a m Σ, where Max is taken over all the paths from q i to q m. We can represent transitions more conveniently by the matrix notation as follows: For each a Σ, we can form a n n matrix F (a) whose (i, j) th element is f M (q i, a, q j ) 0. Note Throughout this paper, we consider the fuzzy automaton M = (Q, Σ, f M ). That is, we consider a fuzzy automaton without initial state and final state. Definition 2.3 ([3]). A fuzzy automaton M = (Q, Σ, f M ) is called deterministic if for each a Σ and q i Q, there exists a unique state q a such that f M (q i, a, q a ) 0 otherwise it is called nondeterministic. Definition 2.4. A relation R on a set Q is said to be an equivalence relation if it is reflexive, symmetric and transitive. Definition 2.5 ([1, 2]). Let M = (Q, Σ, f M ) be a fuzzy automaton. An equivalence relation R on Q in M is called a congruence relation if for all q i, q j Q and a Σ, q i R q j implies that, then there exists q l, q k Q such that f M (q i, a, q l ) 0, f M (q j, a, q k ) 0 and q l Rq k. Definition 2.6. Let M = (Q, Σ, f M ) be a fuzzy automaton. The quotient fuzzy automaton determined by the congruence = is a fuzzy automaton M/ = = (Q/ =, Σ, f M/ = ), where Q/ = = {Q i = [q i ]} and f M/ = (Q 1, a, Q 2 ) = Min {f M (, a, ) 0 / Q 1, Q 2 and a Σ}. Definition 2.7 ([5]). Let M = (Q, Σ, f M ) be a fuzzy automaton. We say that two states q i, q j Q are stability related and denoted by q i q j, if for any word 332
3 V. Karthikeyan et al. /Ann. Fuzzy Math. Inform. 10 (2015), No. 2, u Σ, there exists a word w Σ and q k Q such that f M (q i, uw, q k ) 0 f M (q i, uw, q k ) 0. Definition 2.8 ([5]). Let M = (Q, Σ, f M ) be a fuzzy automaton. We say that a fuzzy automaton is γ-synchronized at the state q j if there exist a real number γ with 0 < γ 1, and a word w Σ that takes each state q i of Q into q j such that f M (q i, w, q j ) γ, where γ = minimal membership value in a fuzzy automaton. Definition 2.9. Let M = (Q, Σ, f M ) be a fuzzy automaton and letp Q. The γ-synchronization degree is defined as, θ M = Min w Σ {card(p ) / Min {f M (Q, w, P ) 0, q Q, p P }}. A fuzzy automaton is γ-synchronized if and only if θ M is equal to Procedure to Find γ-synchronized Words Let M = (Q, Σ, f M ) be a fuzzy automaton. We define another fuzzy automaton M S as follows: M S = (2 Q, Σ, f MS, Q, F Q), where, Q is called initial state on M S, F is called set of all final states on M S, f MS is the transition function on M S. The transition function f MS is defined by, f MS (P, a, T ) = Min {f M (p, a, t) 0, p P, t T }, P, T 2 Q for a Σ. Clearly, M S is a deterministic fuzzy automaton and more over a word w is γ- synchronized in M if and only if there exists a singleton subsets S 2 Q such that f Ms (Q, w, S) = γ. Consider the following example, a(0.7) a(0.9) Fig
4 V. Karthikeyan et al. /Ann. Fuzzy Math. Inform. 10 (2015), No. 2, Fuzzy Automaton M S Q q2q3q 4 q1q2 q3 q2q4 q1q3 a, q3q4 a(0.7) q1q2 Fig M S contains two elements subsets of Q and hence, γ-synchronization degree is 2. Hence, M is not γ-synchronized. Consider the following example, a(0.7) a(0.9) Fig
5 a(0.9) V. Karthikeyan et al. /Ann. Fuzzy Math. Inform. 10 (2015), No. 2, Fuzzy Automaton M S Q q2q3 q4 q3 q1q4 q1 a(0.7) q2 Fig In M S, S = { } is a singleton subset of Q. Hence, the fuzzy automaton is γ- synchronized with a word ab and γ = Applications Assume that there are 4 cities and two different pipelines that are leaving from each city. Assume that the pipelines are of different width and the particular petrol agency decided to supply petrol through two pipelines. Flow capacity of the pipelines is given. Each pair of city is connected by pipelines with one other. Let C ij be the maintenance cost for the pipeline that connects from i th city to j th city. The main objective is to find the shortest optimum sequence of pipelines to cover all cities (we can start anywhere in n cities) such that the petrol reaches each city atleast once through two different pipelines and ends in a particular city with minimal flow capacity and minimum maintenance cost. Consider the following example, we consider the cities as states, the two different pipelines as alphabets and flow capacity as a membership value. We can construct the given problem as a fuzzy automaton. 335
6 V. Karthikeyan et al. /Ann. Fuzzy Math. Inform. 10 (2015), No. 2, Example 4.1 a(0.7) a(0.6) a(0.9) b(0.3) Fig Cost sheet for pipelines "a" and "b" as follows. pipeline a pipeline b
7 V. Karthikeyan et al. /Ann. Fuzzy Math. Inform. 10 (2015), No. 2, Fuzzy Automaton M S Q q2q3 b(0.3) q4 q1 q1q4 a(0.6) q2 a(0.6) a(0.9) a(0.7) b(0.3) q3 Fig Shortest optimum sequence to cover all cities with minimal flow capacity 1) aabb 2) bbaa such that (i) F (aabb) = (ii)f (bbaa) = Minimum cost calculation 1) For the sequence aabb (i) f M (, aabb, ) = the cost is = 41 (ii)f M (, aabb, ) = the cost is = 47 (iii)f M (, aabb, ) = the cost is = 49 (iv)f M (, aabb, ) = the cost is = 50 2) For the sequence bbaa (i) f M (, bbaa, ) = the cost is = 38 (ii)f M (, bbaa, ) = the cost is = 39 (iii)f M (, bbaa, ) = the cost is = 41 (iv)f M (, bbaa, ) = the cost is = 47 The optimum sequence is f M (, bbaa, ) = such that the minimal cost is Rs
8 V. Karthikeyan et al. /Ann. Fuzzy Math. Inform. 10 (2015), No. 2, Example 4.2 a(0.6) b(0.8) Fig Cost sheet for pipelines "a" and "b" are as follows. pipeline a pipeline b
9 V. Karthikeyan et al. /Ann. Fuzzy Math. Inform. 10 (2015), No. 2, Fuzzy Automaton M s Q q1q4 q4 q1q2 q2q3 q2q4 q1q3 q1q2 q3 Fig In M S contains two elements subsets of Q and hence γ synchronization degree is 2. Hence M is not γ synchronized. In the above fuzzy automaton (Fig - 4.3), for any word u Σ, there exists a word ba Σ and q k Q such that f M (, uba, q k ) 0 f M (, uba, q k ) 0. Therefore, the states and are stability related. For any word u Σ, there exists a word aa Σ and q l Q such that f M (, uaa, q l ) 0 f M (, uaa, q l ) 0. Therefore, the states and are stability related. The Quotient Fuzzy Automaton F b(0.8) Fig
10 V. Karthikeyan et al. /Ann. Fuzzy Math. Inform. 10 (2015), No. 2, The Relabeled Quotient Fuzzy Automaton F b(0.8) Fig The Relabeled Fuzzy Automaton M 1 b(0.8) a(0.6) Fig
11 V. Karthikeyan et al. /Ann. Fuzzy Math. Inform. 10 (2015), No. 2, Fuzzy Automaton M S Q q4q3 q1q2 b(0.8) q4 q1 b(0.8) a(0.6) q3 q2 Fig Shortest optimum sequence to cover all cities with minimal flow capacity 1) bbaa such that (i)f (bbaa) = Minimum cost calculation 1) For the sequence bbaa (i) f M1 (, bbaa, ) = the cost is = 15 (ii)f M1 (, bbaa, ) = the cost is = 15 (iii)f M1 (, bbaa, ) = the cost is = 21 (iv)f M1 (, bbaa, ) = the cost is = 21 The optimum sequence is f M1 (, bbaa, ) = and f M1 (, bbaa, ) = such that the minimal cost is Rs
12 V. Karthikeyan et al. /Ann. Fuzzy Math. Inform. 10 (2015), No. 2, Conclusion In this paper, we introduce γ-synchronization degree of a fuzzy automaton and procedure is given to find γ-synchronized words. We introduce an application related to petrol passing through two different pipelines in 4 cities. The objective is to find shortest optimum sequence of pipelines to cover all cities (we can start anywhere in 4 cities) such that the petrol reaches each city at least once and ends in a particular city with minimal flow capacity and minimum maintenance cost. References [1] Y. Cao, G. Chen and E. Kerre, Bisimulations for fuzzy-transition systems, IEEE Transactions on Fuzzy Systems 19 (2011) [2] Y. Cao and Y. Ezawa, Nondeterministic fuzzy automata, Information Sciences 191 (2012) [3] M. Doostfatemeh and S. C. Kremer, New directions in fuzzy automata, International Journal of Approximate Reasoning 38 (2005) [4] A. Kandel and S. C. Lee, Fuzzy switching and automata theory applications, Edward Arnold Publishers Ltd. London [5] V. Karthikeyan and M. Rajasekar, Relation in fuzzy automata, Advances in Fuzzy Mathematics, 6(1) (2011) [6] W. G. Wee, On Generalizations of Adaptive Algorithm and Application Of The Fuzzy Sets Concept to Pattern Classification, Ph.D Thesis Purude University [7] L. A. Zadeh, Fuzzy sets, Information and Control 8 (1965) [8] H. J. Zimmermann, Fuzzy Set Theory and its Applications, International Series in Management Science/ Operation Research, Kluwer- Nijhoff, Boston, MA V. Karthikeyan (vkarthikau@gmail.com) Mathematics Section, Faculty of Engineering and Technology, Annamalai University, Annamalai Nagar, Chidambaram, Tamilnadu, India M. Rajasekar (mdivraj1962@gmail.com) Mathematics Section, Faculty of Engineering and Technology, Annamalai University, Annamalai Nagar, Chidambaram, Tamilnadu, India
Metamorphosis of Fuzzy Regular Expressions to Fuzzy Automata using the Follow Automata
Metamorphosis of Fuzzy Regular Expressions to Fuzzy Automata using the Follow Automata Rahul Kumar Singh, Ajay Kumar Thapar University Patiala Email: ajayloura@gmail.com Abstract To deal with system uncertainty,
More informationMax-max operation on intuitionistic fuzzy matrix. Riyaz Ahmad Padder, P. Murugadas
Annals of Fuzzy Mathematics and Informatics Volume x, No. x, (Month 201y), pp. 1 xx ISSN: 2093 9310 (print version) ISSN: 2287 6235 (electronic version) http://www.afmi.or.kr @FMI c Kyung Moon Sa Co. http://www.kyungmoon.com
More information@FMI c Kyung Moon Sa Co.
Annals of Fuzzy Mathematics and Informatics Volume 1, No. 1, (January 2011), pp. 97-105 ISSN 2093-9310 http://www.afmi.or.kr @FMI c Kyung Moon Sa Co. http://www.kyungmoon.com Positive implicative vague
More informationDISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
Iranian Journal of Fuzzy Systems Vol. 14, No. 5, (2017) pp. 19-30 19 DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA R. VERMA AND S. P. TIWARI Abstract. In this paper, we introduce
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 6 CHAPTER 2 FINITE AUTOMATA 2. Nondeterministic Finite Automata NFA 3. Finite Automata and Regular Expressions 4. Languages
More informationA neutrosophic soft set approach to a decision making problem. Pabitra Kumar Maji
Annals of Fuzzy Mathematics and Informatics Volume 3, No. 2, (April 2012), pp. 313-319 ISSN 2093 9310 http://www.afmi.or.kr @FMI c Kyung Moon Sa Co. http://www.kyungmoon.com A neutrosophic soft set approach
More information@FMI c Kyung Moon Sa Co.
Annals of Fuzzy Mathematics and Informatics Volume 1, No. 2, April 2011, pp. 163-169 ISSN 2093 9310 http://www.afmi.or.kr @FMI c Kyung Moon Sa Co. http://www.kyungmoon.com Semicompactness in L-fuzzy topological
More informationNondeterministic Finite Automata
Nondeterministic Finite Automata Not A DFA Does not have exactly one transition from every state on every symbol: Two transitions from q 0 on a No transition from q 1 (on either a or b) Though not a DFA,
More information@FMI c Kyung Moon Sa Co.
Annals of Fuzzy Mathematics and Informatics Volume 5 No. 1 (January 013) pp. 157 168 ISSN: 093 9310 (print version) ISSN: 87 635 (electronic version) http://www.afmi.or.kr @FMI c Kyung Moon Sa Co. http://www.kyungmoon.com
More informationL fuzzy ideals in Γ semiring. M. Murali Krishna Rao, B. Vekateswarlu
Annals of Fuzzy Mathematics and Informatics Volume 10, No. 1, (July 2015), pp. 1 16 ISSN: 2093 9310 (print version) ISSN: 2287 6235 (electronic version) http://www.afmi.or.kr @FMI c Kyung Moon Sa Co. http://www.kyungmoon.com
More informationAPPLICATIONS OF A GROUP IN GENERAL FUZZY AUTOMATA. Communicated by S. Alikhani
Algebraic Structures and Their Applications Vol. 4 No. 2 ( 2017 ) pp 57-69. APPLICATIONS OF A GROUP IN GENERAL FUZZY AUTOMATA M. HORRY Communicated by S. Alikhani Abstract. Let F = (Q, Σ, R, Z, ω, δ, F
More informationAutomata and Languages
Automata and Languages Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan Nondeterministic Finite Automata with empty moves (-NFA) Definition A nondeterministic finite automaton
More informationTheory of Computation
Thomas Zeugmann Hokkaido University Laboratory for Algorithmics http://www-alg.ist.hokudai.ac.jp/ thomas/toc/ Lecture 3: Finite State Automata Motivation In the previous lecture we learned how to formalize
More informationENERGY OF A COMPLEX FUZZY GRAPH
International J. of Math. Sci. & Engg. Appls. (IJMSEA) ISSN 0973-9424, Vol. 10 No. I (April, 2016), pp. 243-248 ENERGY OF A COMPLEX FUZZY GRAPH P. THIRUNAVUKARASU 1, R. SURESH 2 AND K. K. VISWANATHAN 3
More information@FMI c Kyung Moon Sa Co.
Annals of Fuzzy Mathematics and Informatics Volume 4, No. 2, October 2012), pp. 365 375 ISSN 2093 9310 http://www.afmi.or.kr @FMI c Kyung Moon Sa Co. http://www.kyungmoon.com On soft int-groups Kenan Kaygisiz
More informationOn Fuzzy Automata Homotopy
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 9 (2017), pp. 4677-4693 Research India Publications http://www.ripublication.com On Fuzzy Automata Homotopy 1 K.Saranya
More informationGeneral Fuzzy Automata
Chapter 4 General Fuzzy Automata 4.1 Introduction Doostfatemeh and Kremer [15] have kindly revised the developments in fuzzy automata theory and pointed out certain important issues such as i) membership
More informationThe Moore-Penrose Inverse of. Intuitionistic Fuzzy Matrices
Int. Journal of Math. Analysis, Vol. 4, 2010, no. 36, 1779-1786 The Moore-Penrose Inverse of Intuitionistic Fuzzy Matrices S. Sriram 1 and P. Murugadas 2 Abstract In this paper, we define the various g-inverses
More informationChapter Five: Nondeterministic Finite Automata
Chapter Five: Nondeterministic Finite Automata From DFA to NFA A DFA has exactly one transition from every state on every symbol in the alphabet. By relaxing this requirement we get a related but more
More informationQ-cubic ideals of near-rings
Inter national Journal of Pure and Applied Mathematics Volume 113 No. 10 2017, 56 64 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Q-cubic ideals
More informationType-2 Fuzzy Shortest Path
Intern. J. Fuzzy Mathematical rchive Vol. 2, 2013, 36-42 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 15 ugust 2013 www.researchmathsci.org International Journal of Type-2 Fuzzy Shortest Path V.
More informationCS 154, Lecture 2: Finite Automata, Closure Properties Nondeterminism,
CS 54, Lecture 2: Finite Automata, Closure Properties Nondeterminism, Why so Many Models? Streaming Algorithms 0 42 Deterministic Finite Automata Anatomy of Deterministic Finite Automata transition: for
More informationAlmost Asymptotically Statistical Equivalent of Double Difference Sequences of Fuzzy Numbers
Mathematica Aeterna, Vol. 2, 202, no. 3, 247-255 Almost Asymptotically Statistical Equivalent of Double Difference Sequences of Fuzzy Numbers Kuldip Raj School of Mathematics Shri Mata Vaishno Devi University
More informationAn Evolution Strategy for the Induction of Fuzzy Finite-state Automata
Journal of Mathematics and Statistics 2 (2): 386-390, 2006 ISSN 1549-3644 Science Publications, 2006 An Evolution Strategy for the Induction of Fuzzy Finite-state Automata 1,2 Mozhiwen and 1 Wanmin 1 College
More informationIntroduction to Formal Languages, Automata and Computability p.1/51
Introduction to Formal Languages, Automata and Computability Finite State Automata K. Krithivasan and R. Rama Introduction to Formal Languages, Automata and Computability p.1/51 Introduction As another
More informationSome Aspects of 2-Fuzzy 2-Normed Linear Spaces
BULLETIN of the Malaysian Mathematical Sciences Society http://math.usm.my/bulletin Bull. Malays. Math. Sci. Soc. (2) 32(2) (2009), 211 221 Some Aspects of 2-Fuzzy 2-Normed Linear Spaces 1 R. M. Somasundaram
More informationOn closures of lexicographic star-free languages. E. Ochmański and K. Stawikowska
On closures of lexicographic star-free languages E. Ochmański and K. Stawikowska Preprint No 7/2005 Version 1, posted on April 19, 2005 On closures of lexicographic star-free languages Edward Ochma ski
More informationKleene Algebras and Algebraic Path Problems
Kleene Algebras and Algebraic Path Problems Davis Foote May 8, 015 1 Regular Languages 1.1 Deterministic Finite Automata A deterministic finite automaton (DFA) is a model of computation that can simulate
More informationUses of finite automata
Chapter 2 :Finite Automata 2.1 Finite Automata Automata are computational devices to solve language recognition problems. Language recognition problem is to determine whether a word belongs to a language.
More informationSolution of Fuzzy System of Linear Equations with Polynomial Parametric Form
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 7, Issue 2 (December 2012), pp. 648-657 Applications and Applied Mathematics: An International Journal (AAM) Solution of Fuzzy System
More information@FMI c Kyung Moon Sa Co.
Annals of Fuzzy Mathematics and Informatics Volume x, No. x, (Month 201y), pp. 1 xx ISSN: 2093 9310 (print version) ISSN: 2287 6235 (electronic version) http://www.afmi.or.kr @FMI c Kyung Moon Sa Co. http://www.kyungmoon.com
More information@FMI c Kyung Moon Sa Co.
nnals of Fuzzy Mathematics and Informatics Volume 9, No. 6, (June 2015), pp. 917 923 ISSN: 2093 9310 (print version) ISSN: 2287 6235 (electronic version) http://www.afmi.or.kr @FMI c Kyung Moon Sa Co.
More informationSYNTACTIC SEMIGROUP PROBLEM FOR THE SEMIGROUP REDUCTS OF AFFINE NEAR-SEMIRINGS OVER BRANDT SEMIGROUPS
SYNTACTIC SEMIGROUP PROBLEM FOR THE SEMIGROUP REDUCTS OF AFFINE NEAR-SEMIRINGS OVER BRANDT SEMIGROUPS JITENDER KUMAR AND K. V. KRISHNA Abstract. The syntactic semigroup problem is to decide whether a given
More informationarxiv: v1 [cs.lo] 16 Jul 2017
SOME IMPROVEMENTS IN FUZZY TURING MACHINES HADI FARAHANI arxiv:1707.05311v1 [cs.lo] 16 Jul 2017 Department of Computer Science, Shahid Beheshti University, G.C, Tehran, Iran h farahani@sbu.ac.ir Abstract.
More informationWhat You Must Remember When Processing Data Words
What You Must Remember When Processing Data Words Michael Benedikt, Clemens Ley, and Gabriele Puppis Oxford University Computing Laboratory, Park Rd, Oxford OX13QD UK Abstract. We provide a Myhill-Nerode-like
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 5 CHAPTER 2 FINITE AUTOMATA 1. Deterministic Finite Automata DFA 2. Nondeterministic Finite Automata NDFA 3. Finite Automata
More informationNondeterministic Finite Automata and Regular Expressions
Nondeterministic Finite Automata and Regular Expressions CS 2800: Discrete Structures, Spring 2015 Sid Chaudhuri Recap: Deterministic Finite Automaton A DFA is a 5-tuple M = (Q, Σ, δ, q 0, F) Q is a finite
More informationBüchi Automata and their closure properties. - Ajith S and Ankit Kumar
Büchi Automata and their closure properties - Ajith S and Ankit Kumar Motivation Conventional programs accept input, compute, output result, then terminate Reactive program : not expected to terminate
More informationDescribing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata
Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata Natalia Kushik and Nina Yevtushenko Tomsk State University, Russia 2 Motivation Relies
More informationAlgorithms for Computing Complete Deterministic Fuzzy Automata via Invariant Fuzzy Quasi-Orders
Faculty of Sciences and Mathematics Department of Computer Science University of Niš, Serbia Algorithms for Computing Complete Deterministic Fuzzy Automata via Invariant Fuzzy Quasi-Orders Stefan Stanimirović
More informationKalavakkam, Chennai, , Tamilnadu, INDIA 2,3 School of Advanced Sciences. VIT University Vellore, , Tamilnadu, INDIA
International Journal of Pure and Applied Mathematics Volume 09 No. 4 206, 799-82 ISSN: 3-8080 (printed version); ISSN: 34-3395 (on-line version) url: http://www.ijpam.eu doi: 0.2732/ijpam.v09i4.4 PAijpam.eu
More informationFINITE STATE MACHINES (AUTOMATA)
FINITE STATE MACHINES (AUTOMATA) Switch Example Think about the On/Off button Switch Example The corresponding Automaton Off Push On Push Input: Push Push Push Push Vending Machine Example 2 Vending machine
More informationIntroduction to the Theory of Computation. Automata 1VO + 1PS. Lecturer: Dr. Ana Sokolova.
Introduction to the Theory of Computation Automata 1VO + 1PS Lecturer: Dr. Ana Sokolova http://cs.uni-salzburg.at/~anas/ Setup and Dates Lectures and Instructions 23.10. 3.11. 17.11. 24.11. 1.12. 11.12.
More informationCS 455/555: Finite automata
CS 455/555: Finite automata Stefan D. Bruda Winter 2019 AUTOMATA (FINITE OR NOT) Generally any automaton Has a finite-state control Scans the input one symbol at a time Takes an action based on the currently
More informationCSCI 2670 Introduction to Theory of Computing
CSCI 267 Introduction to Theory of Computing Agenda Last class Reviewed syllabus Reviewed material in Chapter of Sipser Assigned pages Chapter of Sipser Questions? This class Begin Chapter Goal for the
More informationFuzzy Difference Equations in Finance
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 8, August 2014, PP 729-735 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org Fuzzy Difference
More informationMulti level inventory management decisions with transportation cost consideration in fuzzy environment. W. Ritha, S.
Annals of Fuzzy Mathematics and Informatics Volume 2, No. 2, October 2011, pp. 171-181 ISSN 2093 9310 http://www.afmi.or.kr @FMI c Kyung Moon Sa Co. http://www.kyungmoon.com Multi level inventory management
More informationTheory of Computation Turing Machine and Pushdown Automata
Theory of Computation Turing Machine and Pushdown Automata 1. What is a Turing Machine? A Turing Machine is an accepting device which accepts the languages (recursively enumerable set) generated by type
More informationUNIT-II. NONDETERMINISTIC FINITE AUTOMATA WITH ε TRANSITIONS: SIGNIFICANCE. Use of ε-transitions. s t a r t. ε r. e g u l a r
Syllabus R9 Regulation UNIT-II NONDETERMINISTIC FINITE AUTOMATA WITH ε TRANSITIONS: In the automata theory, a nondeterministic finite automaton (NFA) or nondeterministic finite state machine is a finite
More informationOn fuzzy multiset regular grammars. B. K. Sharma, Apostolos Syropoulos, S. P. Tiwari
Annals of Fuzzy Mathematics and Informatics Volume 12, No 5, (November 2016), pp 617 639 ISSN: 2093 9310 (print version) ISSN: 2287 6235 (electronic version) http://wwwafmiorkr @FMI c Kyung Moon Sa Co
More informationEE291E Lecture Notes 3 Autonomous Hybrid Automata
EE9E Lecture Notes 3 Autonomous Hybrid Automata Claire J. Tomlin January, 8 The lecture notes for this course are based on the first draft of a research monograph: Hybrid Systems. The monograph is copyright
More informationAnalysis and Optimization of Discrete Event Systems using Petri Nets
Volume 113 No. 11 2017, 1 10 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Analysis and Optimization of Discrete Event Systems using Petri Nets
More informationIntroduction to Formal Languages, Automata and Computability p.1/42
Introduction to Formal Languages, Automata and Computability Pushdown Automata K. Krithivasan and R. Rama Introduction to Formal Languages, Automata and Computability p.1/42 Introduction We have considered
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
15-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY REVIEW for MIDTERM 1 THURSDAY Feb 6 Midterm 1 will cover everything we have seen so far The PROBLEMS will be from Sipser, Chapters 1, 2, 3 It will be
More informationChapter 6: NFA Applications
Chapter 6: NFA Applications Implementing NFAs The problem with implementing NFAs is that, being nondeterministic, they define a more complex computational procedure for testing language membership. To
More informationA Fuzzy Approach to Priority Queues
International Journal of Fuzzy Mathematics and Systems. ISSN 2248-9940 Volume 2, Number 4 (2012), pp. 479-488 Research India Publications http://www.ripublication.com A Fuzzy Approach to Priority Queues
More informationSOME (FUZZY) TOPOLOGIES ON GENERAL FUZZY AUTOMATA
Iranian Journal of Fuzzy Systems Vol. 10, No. 6, (2013) pp. 73-89 73 SOME (FUZZY) TOPOLOGIES ON GENERAL FUZZY AUTOMATA M. HORRY AND M. M. ZAHEDI Abstract. In this paper, by presenting some notions and
More informationFinite Automata and Regular Languages (part III)
Finite Automata and Regular Languages (part III) Prof. Dan A. Simovici UMB 1 / 1 Outline 2 / 1 Nondeterministic finite automata can be further generalized by allowing transitions between states without
More informationAutomata and Languages
Automata and Languages Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan FINITE STATE MACHINES (AUTOMATA) Switch Example Think about the On/Off button Switch Example The corresponding
More informationNondeterministic Finite Automata
Nondeterministic Finite Automata Lecture 6 Section 2.2 Robb T. Koether Hampden-Sydney College Mon, Sep 5, 2016 Robb T. Koether (Hampden-Sydney College) Nondeterministic Finite Automata Mon, Sep 5, 2016
More informationDISTINGUING NON-DETERMINISTIC TIMED FINITE STATE MACHINES
DISTINGUING NON-DETERMINISTIC TIMED FINITE STATE MACHINES Maxim Gromov 1, Khaled El-Fakih 2, Natalia Shabaldina 1, Nina Yevtushenko 1 1 Tomsk State University, 36 Lenin Str.. Tomsk, 634050, Russia gromov@sibmail.com,
More informationA Generalization of Generalized Triangular Fuzzy Sets
International Journal of Mathematical Analysis Vol, 207, no 9, 433-443 HIKARI Ltd, wwwm-hikaricom https://doiorg/02988/ijma2077350 A Generalization of Generalized Triangular Fuzzy Sets Chang Il Kim Department
More informationPAijpam.eu ON FUZZY INVENTORY MODEL WITH ALLOWABLE SHORTAGE
International Journal of Pure and Applied Mathematics Volume 99 No. 205, 5-7 ISSN: 3-8080 (printed version; ISSN: 34-3395 (on-line version url: http://www.ijpam.eu doi: http://dx.doi.org/0.2732/ijpam.v99i.
More informationNew approach to solve symmetric fully fuzzy linear systems
Sādhanā Vol. 36, Part 6, December 2011, pp. 933 940. c Indian Academy of Sciences New approach to solve symmetric fully fuzzy linear systems 1. Introduction P SENTHILKUMAR and G RAJENDRAN Department of
More informationINF Introduction and Regular Languages. Daniel Lupp. 18th January University of Oslo. Department of Informatics. Universitetet i Oslo
INF28 1. Introduction and Regular Languages Daniel Lupp Universitetet i Oslo 18th January 218 Department of Informatics University of Oslo INF28 Lecture :: 18th January 1 / 33 Details on the Course consists
More informationIntroduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)
More informationMINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES
Iranian Journal of Fuzzy Systems Vol. 10, No. 1, (2013) pp. 75-88 75 MINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES A. CHOUBEY AND K. M.
More informationOn (m,n)-ideals in LA-Semigroups
Applied Mathematical Sciences, Vol. 7, 2013, no. 44, 2187-2191 HIKARI Ltd, www.m-hikari.com On (m,n)-ideals in LA-Semigroups Muhammad Akram University of Gujrat Gujrat, Pakistan makram 69@yahoo.com Naveed
More informationRecap DFA,NFA, DTM. Slides by Prof. Debasis Mitra, FIT.
Recap DFA,NFA, DTM Slides by Prof. Debasis Mitra, FIT. 1 Formal Language Finite set of alphabets Σ: e.g., {0, 1}, {a, b, c}, { {, } } Language L is a subset of strings on Σ, e.g., {00, 110, 01} a finite
More information@FMI c Kyung Moon Sa Co.
Annals of Fuzzy Mathematics and Informatics Volume 7, No. 2, (February 2014), pp. 281 287 ISSN: 2093 9310 (print version) ISSN: 2287 6235 (electronic version) http://www.afmi.or.kr @FMI c Kyung Moon Sa
More informationTheory of Computation (I) Yijia Chen Fudan University
Theory of Computation (I) Yijia Chen Fudan University Instructor Yijia Chen Homepage: http://basics.sjtu.edu.cn/~chen Email: yijiachen@fudan.edu.cn Textbook Introduction to the Theory of Computation Michael
More informationSome remarks on hyper MV -algebras
Journal of Intelligent & Fuzzy Systems 27 (2014) 2997 3005 DOI:10.3233/IFS-141258 IOS Press 2997 Some remarks on hyper MV -algebras R.A. Borzooei a, W.A. Dudek b,, A. Radfar c and O. Zahiri a a Department
More informationCOM364 Automata Theory Lecture Note 2 - Nondeterminism
COM364 Automata Theory Lecture Note 2 - Nondeterminism Kurtuluş Küllü March 2018 The FA we saw until now were deterministic FA (DFA) in the sense that for each state and input symbol there was exactly
More informationSemi Global Dominating Set of Intuitionistic fuzzy graphs
IOSR Journal of Mathematics (IOSR-JM) e-issn: 78-578, p-issn:319-765x. Volume 10, Issue 4 Ver. II (Jul-Aug. 014), PP 3-7 Semi Global Dominating Set of Intuitionistic fuzzy graphs 1 S. Yahya Mohamed and
More informationFuzzy Almost Contra rw-continuous Functions in Topological Spaces
International Journal of Mathematics Research. ISSN 0976-5840 Volume 5, Number 1 (2013), pp. 109 117 International Research Publication House http://www.irphouse.com Fuzzy Almost Contra rw-continuous Functions
More informationPARAMETRIC OPERATIONS FOR TWO FUZZY NUMBERS
Commun. Korean Math. Soc. 8 (03), No. 3, pp. 635 64 http://dx.doi.org/0.434/ckms.03.8.3.635 PARAMETRIC OPERATIONS FOR TWO FUZZY NUMBERS Jisoo Byun and Yong Sik Yun Abstract. There are many results on the
More informationChapter 2: Finite Automata
Chapter 2: Finite Automata 2.1 States, State Diagrams, and Transitions Finite automaton is the simplest acceptor or recognizer for language specification. It is also the simplest model of a computer. A
More informationSHORTEST PATH PROBLEM BY MINIMAL SPANNING TREE ALGORITHM USING BIPOLAR NEUTROSOPHIC NUMBERS
SHORTEST PATH PROBLEM BY MINIMAL SPANNING TREE ALGORITHM USING BIPOLAR NEUTROSOPHIC NUMBERS M. Mullaia, S. Broumib, A. Stephenc a Department of Mathematics, Alagappa University, Karaikudi, Tamilnadu, India.
More informationGreat Theoretical Ideas in Computer Science. Lecture 4: Deterministic Finite Automaton (DFA), Part 2
5-25 Great Theoretical Ideas in Computer Science Lecture 4: Deterministic Finite Automaton (DFA), Part 2 January 26th, 27 Formal definition: DFA A deterministic finite automaton (DFA) M =(Q,,,q,F) M is
More informationOn Intuitionitic Fuzzy Maximal Ideals of. Gamma Near-Rings
International Journal of Algebra, Vol. 5, 2011, no. 28, 1405-1412 On Intuitionitic Fuzzy Maximal Ideals of Gamma Near-Rings D. Ezhilmaran and * N. Palaniappan Assistant Professor, School of Advanced Sciences,
More informationTimed Watson-Crick Online Tessellation Automaton
Annals of Pure and Applied Mathematics Vol. 8, No. 2, 204, 75-82 ISSN: 2279-087X (P), 2279-0888(online) Published on 7 December 204 www.researchmathsci.org Annals of Timed Watson-Cric Online Tessellation
More informationLipschitz Robustness of Finite-state Transducers
Lipschitz Robustness of Finite-state Transducers Roopsha Samanta IST Austria Joint work with Tom Henzinger and Jan Otop December 16, 2014 Roopsha Samanta Lipschitz Robustness of Finite-state Transducers
More informationTheory of Computation
Theory of Computation COMP363/COMP6363 Prerequisites: COMP4 and COMP 6 (Foundations of Computing) Textbook: Introduction to Automata Theory, Languages and Computation John E. Hopcroft, Rajeev Motwani,
More informationA Note on the Reduction of Two-Way Automata to One-Way Automata
A Note on the Reduction of Two-Way Automata to One-Way Automata Moshe Y. Vardi IBM Almaden Research Center Abstract We describe a new elementary reduction of two-way automata to one-way automata. The reduction
More informationThe Number of Fuzzy Subgroups of Group Defined by A Presentation
International Journal of Algebra, Vol 5, 2011, no 8, 375-382 The Number of Fuzzy Subgroups of Group Defined by A Presentation Raden Sulaiman Department of Mathematics, Faculty of Mathematics and Sciences
More informationIntroduction to the Theory of Computation. Automata 1VO + 1PS. Lecturer: Dr. Ana Sokolova.
Introduction to the Theory of Computation Automata 1VO + 1PS Lecturer: Dr. Ana Sokolova http://cs.uni-salzburg.at/~anas/ Setup and Dates Lectures Tuesday 10:45 pm - 12:15 pm Instructions Tuesday 12:30
More informationFundamental Problems of Fuzzy Automata Theory
Fundamental Problems of Fuzzy Automata Theory Jelena Ignjatović Department of Computer Science Faculty of Sciences University of Niš, Serbia jelenaignjatovic@pmfedurs ARISTOTLE UNIVERSITY OF THESSALONIKI
More informationJumping Finite Automata
Jumping Finite Automata Alexander Meduna and Petr Zemek Brno University of Technology, Faculty of Information Technology IT4Innovations Centre of Excellence Božetěchova 2, 612 00 Brno, Czech Republic http://www.fit.vutbr.cz/
More informationFinite State Automata
Trento 2005 p. 1/4 Finite State Automata Automata: Theory and Practice Paritosh K. Pandya (TIFR, Mumbai, India) Unversity of Trento 10-24 May 2005 Trento 2005 p. 2/4 Finite Word Langauges Alphabet Σ is
More informationAutomata Theory (2A) Young Won Lim 5/31/18
Automata Theory (2A) Copyright (c) 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
More informationSolution of Fuzzy Maximal Flow Network Problem Based on Generalized Trapezoidal Fuzzy Numbers with Rank and Mode
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 9, Issue 7 (January 2014), PP. 40-49 Solution of Fuzzy Maximal Flow Network Problem
More informationNew Algorithms for Solving Interval Valued Fuzzy Relational Equations
Intern. J. Fuzzy Mathematical Archive Vol. 1, 2013, 92-98 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 24 April 2013 www.researchmathsci.org International Journal of New Algorithms for Solving
More informationMathematical Preliminaries. Sipser pages 1-28
Mathematical Preliminaries Sipser pages 1-28 Mathematical Preliminaries This course is about the fundamental capabilities and limitations of computers. It has 3 parts 1. Automata Models of computation
More informationNon Deterministic Recognizability of Fuzzy Languages
Applied Mathematical Sciences, Vol. 1, 2007, no. 17, 821-826 Non Deterministic Recognizability of Fuzzy Languages Olympia Louskou-Bozapalidou Section of Mathematics and Informatics Technical Institute
More informationMERGING STATES IN DETERMINISTIC FUZZY FINITE TREE AUTOMATA BASED ON FUZZY SIMILARITY MEASURES
italian journal of pure and applied mathematics n. 33 2014 (225 240) 225 MERGING STATES IN DETERMINISTIC FUZZY FINITE TREE AUTOMATA BASED ON FUZZY SIMILARITY MEASURES Somaye Moghari Department of Mathematical
More information2. Elements of the Theory of Computation, Lewis and Papadimitrou,
Introduction Finite Automata DFA, regular languages Nondeterminism, NFA, subset construction Regular Epressions Synta, Semantics Relationship to regular languages Properties of regular languages Pumping
More informationDecision, Computation and Language
Decision, Computation and Language Non-Deterministic Finite Automata (NFA) Dr. Muhammad S Khan (mskhan@liv.ac.uk) Ashton Building, Room G22 http://www.csc.liv.ac.uk/~khan/comp218 Finite State Automata
More informationConstructions on Finite Automata
Constructions on Finite Automata Informatics 2A: Lecture 4 Mary Cryan School of Informatics University of Edinburgh mcryan@inf.ed.ac.uk 24 September 2018 1 / 33 Determinization The subset construction
More informationC6.2 Push-Down Automata
Theory of Computer Science April 5, 2017 C6. Context-free Languages: Push-down Automata Theory of Computer Science C6. Context-free Languages: Push-down Automata Malte Helmert University of Basel April
More informationCMPSCI 250: Introduction to Computation. Lecture #22: From λ-nfa s to NFA s to DFA s David Mix Barrington 22 April 2013
CMPSCI 250: Introduction to Computation Lecture #22: From λ-nfa s to NFA s to DFA s David Mix Barrington 22 April 2013 λ-nfa s to NFA s to DFA s Reviewing the Three Models and Kleene s Theorem The Subset
More information