FUZZY RELATION EQUATIONS AND FUZZY AUTOMATA
|
|
- Bartholomew Cunningham
- 5 years ago
- Views:
Transcription
1 FUZZY RELATION EQUATIONS AND FUZZY AUTOMATA Miroslav Ćirić 1, Jelena Ignjatović 1 and Nada Damljanović 2 1 University of Niš, Faculty of Sciences and Mathematics Višegradska 33, Niš, Serbia miroslav.ciric@pmf.edu.rs, jelena.ignjatovic@pmf.edu.rs 2 University of Kragujevac, Technical faculty in Čačak Svetog Save 65, Čačak, Serbia nada@tfc.kg.ac.rs Research supported by Ministry of Education and Science, Republic of Serbia, Grant No Liptovský Ján ( ) FSTA 2012 Nada Damljanović 1 / 22
2 Fuzzy relation equations and inequalities Employed in the study of fuzzy automata: in the study of simulation, bisimulation and equivalence of fuzzy automata, in the reduction of the number of states of fuzzy automata, in the study of subsystems of fuzzy transition systems... These applications have led to the introduction of certain new types of fuzzy relation equations and inequalities, which have been investigated from the general point of view. Liptovský Ján ( ) FSTA 2012 Nada Damljanović 2 / 22
3 Basic concepts Fuzzy relations L = (L,,,,, 0, 1) complete residuated lattice ϕ : A B L fuzzy relation between sets A and B R(A, B) lattice of fuzzy relations between A and B ϕ : A A L fuzzy relation on a set A R(A) lattice of fuzzy relations on A ϕ ψ composition of fuzzy relations ϕ R(A, B) and ψ R(B, C) (ϕ ψ)(a, c) = b B ϕ(a, b) ψ(b, c) (a A, c C) ϕ 1 R(B, A) inverse of a fuzzy relation ϕ R(A, B) ϕ 1 (b, a) def = ϕ(a, b) (a A, b B) Liptovský Ján ( ) FSTA 2012 Nada Damljanović 3 / 22
4 Basic concepts L complete residuated lattice, X alphabet Fuzzy automaton over L and X a quadruple A = (A, δ A, σ A, τ A ) A (non-empty) set of states δ A : A X A L fuzzy transition function σ A : A L fuzzy set of initial states τ A : A L fuzzy set terminal states X the free monoid over the alphabet X δ A can be uniquely extended up to a mapping δ A fuzzy transition relation on A determined by u X : A X A L δ A u (a, b) = δ A (a, u, b), for all a, b A (1) δ A uv = δ A u δ A v, for all u, v X (2) Liptovský Ján ( ) FSTA 2012 Nada Damljanović 4 / 22
5 Bisimulations Origin of bisimulation concurrency theory R. Milner, 1980, D. Park, 1981 modal logic (Kripke systems) J. van Benthem, 1976 set theory M. Forti, F. Honsell, 1983 Role of bisimulation equivalence between two transition systems, reduction of the number of states Recent research M. Ćirić, J. Ignjatović, N. Damljanović, M. Bašić (FSS, 2012) Bisimulations between fuzzy automata M. Ćirić, J. Ignjatović, I. Jančić, N. Damljanović (FSS, to appear) Computation of the greatest simulations and bisimulations M. Ćirić, J. Ignjatović, M. Bašić, I. Jančić (Comput. Math. Appl., to appear) Bisimulations between nondeterministic automata Liptovský Ján ( ) FSTA 2012 Nada Damljanović 5 / 22
6 Simulations between fuzzy automata A = (A, δ A, σ A, τ A ), B = (B, δ B, σ B, τ B ) fuzzy automata ϕ R(A, B) non-empty fuzzy relation ϕ is a forward simulation if σ A σ B ϕ 1, (fs-1) ϕ 1 δ A x δ B x ϕ 1, for every x X, (fs-2) ϕ 1 τ A τ B, (fs-3) ϕ is a backward simulation if τ A ϕ τ B, (bs-1) δ A x ϕ ϕ δ B x, for every x X, (bs-2) σ A ϕ σ B. (bs-3) Liptovský Ján ( ) FSTA 2012 Nada Damljanović 6 / 22
7 Simulations between fuzzy automata σ A a 0 ϕ b 0 σ B A x 1 x k.... x 1 x k B a k b k x k+1 x k+1 a k+1 b k+1 x k+2 x n.... x k+2 x n τ A a n b n Figure 1: Forward and backward simulation τ B Liptovský Ján ( ) FSTA 2012 Nada Damljanović 7 / 22
8 Bisimulations between fuzzy automata Homotypic bisimulations ϕ is a forward bisimulation if both ϕ and ϕ 1 are forward simulations σ A σ B ϕ 1, σ B σ A ϕ, (fb-1) ϕ 1 δ A x δ B x ϕ 1, ϕ δ B x δ A x ϕ, for every x X, (fb-2) ϕ 1 τ A τ B, ϕ τ B τ A, (fb-3) ϕ is a backward bisimulation, if both ϕ and ϕ 1 are backward simulations τ A ϕ τ B, τ B ϕ 1 τ A, (bb-1) δ A x ϕ ϕ δ B x, δ B x ϕ 1 ϕ 1 δ A x, for every x X, (bb-2) σ A ϕ σ B, σ B ϕ 1 σ A. (bb-3) Liptovský Ján ( ) FSTA 2012 Nada Damljanović 8 / 22
9 Bisimulations between fuzzy automata Heterotypic bisimulations ϕ is a forward-backward bisimulation if ϕ is a forward simulation and ϕ 1 is a backward simulation σ A σ B ϕ 1, τ B ϕ 1 τ A, (fbb-1) ϕ 1 δ A x = δ B x ϕ 1, for every x X, (fbb-2) σ B ϕ 1 σ A, ϕ 1 τ A τ B, (fbb-3) ϕ is a backward-forward bisimulation if ϕ is a backward simulation and ϕ 1 is a forward simulation σ B σ A ϕ, τ A ϕ τ B, (bfb-1) δ A x ϕ = ϕ δ B x, for every x X, (bfb-2) σ A ϕ σ B, ϕ τ B τ A. (bfb-3) Simulations languague inclusion Bisimulations languague equivalence Simulations and bisimulations compatibility with transitions, initial and terminal states Liptovský Ján ( ) FSTA 2012 Nada Damljanović 9 / 22
10 Bisimulations between fuzzy automata Heterotypic bisimulations ϕ is a forward-backward bisimulation if ϕ is a forward simulation and ϕ 1 is a backward simulation σ A σ B ϕ 1, τ B ϕ 1 τ A, (fbb-1) ϕ 1 δ A x = δ B x ϕ 1, for every x X, (fbb-2) σ B ϕ 1 σ A, ϕ 1 τ A τ B, (fbb-3) ϕ is a backward-forward bisimulation if ϕ is a backward simulation and ϕ 1 is a forward simulation σ B σ A ϕ, τ A ϕ τ B, (bfb-1) δ A x ϕ = ϕ δ B x, for every x X, (bfb-2) σ A ϕ σ B, ϕ τ B τ A. (bfb-3) Simulations languague inclusion Bisimulations languague equivalence Simulations and bisimulations compatibility with transitions, initial and terminal states Liptovský Ján ( ) FSTA 2012 Nada Damljanović 9 / 22
11 Computation of the greatest simulations and bisimulations Let A = (A, δ A, σ A, τ A ) and B = (B, δ B, σ B, τ B ) be fuzzy automata. We define fuzzy relations ψ w R(A, B), for w {fs, bs, fb, bb, fbb, bfb}, in the following way: ψ fs = τ A τ B, ψ bs = σ A σ B, ψ fb = (τ A τ B ) (τ A τ B ) = τ A τ B, ψ bb = (σ A σ B ) (σ A σ B ) = σ A σ B, ψ fbb = (τ A τ B ) (σ A σ B ), ψ bfb = (σ A σ B ) (τ A τ B ). Liptovský Ján ( ) FSTA 2012 Nada Damljanović 10 / 22
12 Computation of the greatest simulations and bisimulations Moreover, we define functions φ w : R(A, B) R(A, B), for w {fs, bs, fb, bb, fbb, bfb}, as follows: φ fs (α) = x X[(δ B x α 1 )\δ A x ] 1, φ bs (α) = x X(α δ B x )/δ A x, φ fb (α) = x X[(δ B x α 1 )\δ A x ] 1 [(δ A x α)\δ B x ] = φ fs (α) [φ fs (α 1 )] 1, φ bb (α) = x X[(α δ B x )/δ A x ] [(α 1 δ A x )/δ B x ] 1 = φ bs (α) [φ bs (α 1 )] 1, φ fbb (α) = x X[(δ B x α 1 )\δ A x ] 1 [(α 1 δ A x )/δ B x ] 1 = φ fs (α) [φ bs (α 1 )] 1, φ bfb (α) = x X[(α δ B x )/δ A x ] [(δ A x α)\δ B x ] = φ bs (α) [φ fs (α 1 )] 1, for any α R(A, B). Notice that in the expression φ w (α 1 ) (w {fs, bs}) we denote by φ w a function from R(B, A) into itself. Liptovský Ján ( ) FSTA 2012 Nada Damljanović 11 / 22
13 Computation of the greatest simulations and bisimulations Theorem Let A = (A, δ A, σ A, τ A ) and B = (B, δ B, σ B, τ B ) be fuzzy automata and w {fs, bs, fb, bb, fbb, bfb}. A fuzzy relation ϕ R(A, B) satisfies conditions (w-2) and (w-3) if and only if it satisfies ϕ φ w (ϕ), ϕ ψ w. (3) Boils down on computation of the greatest post-fixed point of the function φ w Liptovský Ján ( ) FSTA 2012 Nada Damljanović 12 / 22
14 Computation of the greatest simulations and bisimulations Theorem Let A = (A, δ A, σ A, τ A ) and B = (B, δ B, σ B, τ B ) be fuzzy automata, let w {fs, bs, fb, bb, fbb, bfb}, and let a sequence {ϕ k } k N of fuzzy relations from R(A, B) be defined by ϕ 1 = ψ w, ϕ k+1 = ϕ k φ w (ϕ k ), for each k N. (4) If Im(ψ w ) x X ( Im(δA x ) Im(δ B x ) ) is a finite subalgebra of L, then the following is true: (a) the sequence {ϕ k } k N is finite and descending, and there is the least natural number k such that ϕ k = ϕ k+1 ; (b) ϕ k is the greatest fuzzy relation in R(A, B) which satisfies (w-2) and (w-3); (c) if ϕ k satisfies (w-1), then it is the greatest fuzzy relation in R(A, B) which satisfies (w-1), (w-2) and (w-3); (d) if ϕ k does not satisfy (w-1), then there is no any fuzzy relation in R(A, B) which satisfies (w-1), (w-2) and (w-3). Liptovský Ján ( ) FSTA 2012 Nada Damljanović 13 / 22
15 Computation of the greatest simulations and bisimulations Theorem Let A = (A, δ A, σ A, τ A ) and B = (B, δ B, σ B, τ B ) be fuzzy automata, let w {fs, bs, fb, bb, fbb, bfb}, let {ϕ k } k N be a sequence of fuzzy relations from R(A, B) defined by (4), and let ϕ = k N ϕ k. (5) If L is a complete residuated lattice satisfying the following conditions: x ( ) y i = (x y i ) and x ( ) y i = (x y i ), (6) i I i I i I for all x L and {y i } i I L. Then the following is true: (a) ϕ is the greatest fuzzy relation in R(A, B) which satisfies (w-2) and (w-3); (b) if ϕ satisfies (w-1), then it is the greatest fuzzy relation in R(A, B) which satisfies (w-1), (w-2) and (w-3); (c) if ϕ does not satisfy (w-1), then there is no any fuzzy relation in R(A, B) which satisfies (w-1), (w-2) and (w-3). Liptovský Ján ( ) FSTA 2012 Nada Damljanović 14 / 22 i I
16 Bisimulation equivalence relations E fuzzy equivalence relation on A = (A, δ A, σ A, τ A ) ( A E, E 1 E, E E E) E is forward bisimulation on A, E δ A x δ A x E, for any x X, and E τ A τ A, E δ A x E = δ A x E, for any x X, and E τ A = τ A. Any fuzzy automaton has the greatest forward and backward simulations, which are fuzzy quasi-orders, and the greatest forward and backward bisimulations, which are fuzzy equivalence relations. State reduction Replace a fuzzy automaton by an equivalent fuzzy automaton with fewer states equivalent recognize the same fuzzy language M. Ćirić, A. Stamenković, J. Ignjatović, T. Petković (LNCS 2007; JCSS 2010) reduction by fuzzy equivalences factor fuzzy automata A. Stamenković, M. Ćirić, J. Ignjatović (IS, to appear) reduction by fuzzy quasi-orders afterset (foreset) fuzzy automata Liptovský Ján ( ) FSTA 2012 Nada Damljanović 15 / 22
17 Uniform forward bisimulations R R(A, B) fuzzy relation F. Klawonn, 2000 partial fuzzy function R R 1 R R M. Ćirić, J. Ignjatović, S. Bogdanović, 2009 uniform fuzzy relation complete, surjective, partial fuzzy function R R 1 R = R (also R 1 R R 1 = R 1 ) uniform fuzzy relation fuzzy equivalence between two sets Theorem Let A = (A, δ A, σ A, τ A ) and B = (B, δ B, σ B, τ B ) be fuzzy automata and let ϕ R(A, B) be a uniform fuzzy relation. Then ϕ is a forward bisimulation if and only if the following hold: σ A ϕ ϕ 1 = σ B ϕ 1, σ A ϕ = σ B ϕ 1 ϕ, (7) δ A x ϕ ϕ 1 = ϕ δ B x ϕ 1, ϕ 1 δ A x ϕ = δ B x ϕ 1 ϕ, x X, (8) τ A = ϕ τ B, ϕ 1 τ A = τ B. (9) Liptovský Ján ( ) FSTA 2012 Nada Damljanović 16 / 22
18 Uniform forward bisimulations Fuzzy equivalence relations on A and B induced by ϕ R(A, B). Kernel of ϕ : E ϕ A(a 1, a 2 ) = b B ϕ(a 1, b) ϕ(a 2, b), for all a 1, a 2 A (10) Co-kernel of ϕ : E ϕ B (b 1, b 2 ) = ϕ(a, b 1 ) ϕ(a, b 2 ), for all b 1, b 2 B a A (11) Theorem Let fuzzy automata A = (A, σ A, X, δ A, τ A ) and B = (B, σ B, X, δ B, τ B ) be UFB-equivalent. Then there exists a uniform forward bisimulation ϕ between A and B whose kernel E ϕ A is the greatest forward bisimulation on A and the co-kernel Eϕ B is the greatest forward bisimulation on B. Moreover, ϕ is the greatest forward bisimulation between A and B. Liptovský Ján ( ) FSTA 2012 Nada Damljanović 17 / 22
19 Uniform forward bisimulations Theorem Let A = (A, δ A, σ A, τ A ) and B = (B, δ B, σ B, τ B ) be fuzzy automata, and let E and F be the greatest forward bisimulations on A and B, respectively. Then A and B are UFB-equivalent if and only if there exists an isomorphism φ : A/E B/F such that for all a 1, a 2 A. Ẽ(E a1, E a2 ) = F(φ(E a1 ), φ(e a2 )), (12) Liptovský Ján ( ) FSTA 2012 Nada Damljanović 18 / 22
20 Weakly linear systems Weakly linear systems {V i } i I R(A), {W i } i I R(B) families of fuzzy relations Z R(A, B) given fuzzy relation U unknown fuzzy relation in R(A, B) (1) U 1 V i W i U 1 (i I) U Z (2) V i U U W i (i I) U Z combinations of (1) and (2) (for U and U 1 ) (3) U 1 V i W i U 1 U W i V i U (i I) U Z (4) V i U U W i W i U 1 U 1 V i (i I) U Z (5) V i U = U W i (i I) U Z (6) U 1 V i = W i U 1 (i I) U Z Liptovský Ján ( ) FSTA 2012 Nada Damljanović 19 / 22
21 Weakly linear systems A = B homogeneous weakly linear sistems J. Ignjatović, M. Ćirić, S. Bogdanović (FSS, 2010) The systems (1) (6) have the greatest solutions. If Z is a fuzzy quasi-order, then the greatest solutions to (1) (3) are fuzzy quasi-orders. If Z is a fuzzy equivalence, then the greatest solutions to (4) (6) are fuzzy equivalences. A B heterogeneous weakly linear sistems J. Ignjatović, M. Ćirić, N. Damljanović, I. Jančić (FSS, 2012) All systems (1) (6) have the greatest solutions (they may be empty). If Z is a partial fuzzy function, then the greatest solutions to (3) and (4) are partial fuzzy functions. Liptovský Ján ( ) FSTA 2012 Nada Damljanović 20 / 22
22 Computation of the greatest solutions φ (1) (R) def = [(W i R 1 )\V i ] 1 i I φ (2) (R) def = i I(R W i )/V i φ (3) (R) def = i I[(W i R 1 )\V i ] 1 [(V i R)\W i ] = φ (1) (R) φ (1) (R 1 ) φ (4) (R) def = i I[(R W i )/V i ] [(R 1 V i )/W i ] 1 = φ (2) (R) φ (2) (R 1 ) φ (5) (R) def = i I[(R W i )/V i ] [(V i R)\W i ] = φ (2) (R) φ (1) (R 1 ) φ (6) (R) def = i I[(W i R 1 )\V i ] 1 [(R 1 V i )/W i ] 1 = φ (1) (R) φ (2) (R 1 ) (Z/V)(a, b) = a A (Z\W)(a, b) = b B V(a, a) Z(a, b) (a A, b B) W(b, b ) Z(a, b ) (a A, b B) Liptovský Ján ( ) FSTA 2012 Nada Damljanović 21 / 22
23 Meaning of uniform solutions The greatest solutions to (3) and (4) partial fuzzy functions (R R 1 R R) Question: When the greatest solution is a uniform fuzzy relation? If there is a uniform solution, then the greatest solution is uniform uniform solution some kind of equivalence between fuzzy relational systems (A, {V i } i I ) and (B, {W i } i I ) H uniform solution H determines an isomorphism between factor fuzzy relational systems of (A, {V i } i I ) and (B, {W i } i I ) w.r.t. fuzzy equivalences H H 1 and H 1 H Liptovský Ján ( ) FSTA 2012 Nada Damljanović 22 / 22
Systems of two-sided linear fuzzy relation equations and inequalities and their applications
Systems of two-sided linear fuzzy relation equations and inequalities and their applications Miroslav Ćirić, Jelena Ignjatović Department of Computer Science Faculty of Sciences and Mathematics University
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 informationSolving weakly linear inequalities for matrices over max-plus semiring and applications to automata theory
Solving weakly linear inequalities for matrices over max-plus semiring and applications to automata theory Nada Damljanović University of Kragujevac, Faculty of Technical Sciences in Čačak, Serbia nada.damljanovic@ftn.kg.ac.rs
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 informationBisimulations for weighted automata over an additively idempotent semiring
Bisimulations for weighted automata over an additively idempotent semiring Nada Damljanović a,, Miroslav Ćirić b, Jelena Ignjatović b a University of Kragujevac, Faculty of Technical Sciences in Čačak,
More informationIvana Z. Micić BISIMULATIONS FOR FUZZY AUTOMATA
University of Niš Faculty of Sciences and Mathematics Department of Computer Science Ivana Z. Micić BISIMULATIONS FOR FUZZY AUTOMATA PhD thesis Niš,2014 Univerzitet u Nišu Prirodno-matematički fakultet
More informationWeakly linear systems of fuzzy relation inequalities and their applications: A brief survey
Filomat 26:2 (2012), 207 241 DOI 10.2298/FIL1202207I Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at:http://www.pmf.ni.ac.rs/filomat Weakly linear systems of fuzzy
More informationStrong Deterministic Fuzzy Automata
Volume-5, Issue-6, December-2015 International Journal of Engineering and Management Research Page Number: 77-81 Strong Deterministic Fuzzy Automata A.Jeyanthi 1, B.Stalin 2 1 Faculty, Department of Mathematics,
More informationA representation of context-free grammars with the help of finite digraphs
A representation of context-free grammars with the help of finite digraphs Krasimir Yordzhev Faculty of Mathematics and Natural Sciences, South-West University, Blagoevgrad, Bulgaria Email address: yordzhev@swu.bg
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 informationSimplification of finite automata
Simplification of finite automata Lorenzo Clemente (University of Warsaw) based on joint work with Richard Mayr (University of Edinburgh) Warsaw, November 2016 Nondeterministic finite automata We consider
More informationOn Frankl conjecture. Coherence in predicate logic. Algebraic theory of fuzzy languages and automata
On Frankl conjecture Vladimir Božin University of Warwick, Coventry, United Kingdom bozin@maths.warwick.ac.uk Frankl conjecture states that for every finite family of sets closed under intersections there
More informationObtaining the syntactic monoid via duality
Radboud University Nijmegen MLNL Groningen May 19th, 2011 Formal languages An alphabet is a non-empty finite set of symbols. If Σ is an alphabet, then Σ denotes the set of all words over Σ. The set Σ forms
More informationA Weak Bisimulation for Weighted Automata
Weak Bisimulation for Weighted utomata Peter Kemper College of William and Mary Weighted utomata and Semirings here focus on commutative & idempotent semirings Weak Bisimulation Composition operators Congruence
More informationPush-down Automata = FA + Stack
Push-down Automata = FA + Stack PDA Definition A push-down automaton M is a tuple M = (Q,, Γ, δ, q0, F) where Q is a finite set of states is the input alphabet (of terminal symbols, terminals) Γ is the
More informationMetamorphosis 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 informationBisimulation for Neighbourhood Structures
Bisimulation for Neighbourhood Structures Helle Hvid Hansen 1,2 Clemens Kupke 2 Eric Pacuit 3 1 Vrije Universiteit Amsterdam (VUA) 2 Centrum voor Wiskunde en Informatica (CWI) 3 Universiteit van Amsterdam
More informationSolutions for Assignment 4 Math 402
Solutions for Assignment 4 Math 402 Page 74, problem 6. Assume that φ : G G is a group homomorphism. Let H = φ(g). We will prove that H is a subgroup of G. Let e and e denote the identity elements of G
More informationON LALLEMENT S LEMMA 1
Novi Sad J. Math. Vol. 40, No. 3, 2010, 3 9 Proc. 3rd Novi Sad Algebraic Conf. (eds. I. Dolinka, P. Marković) ON LALLEMENT S LEMMA 1 Stojan Bogdanović 2, Žarko Popović 3, Miroslav Ćirić 4 Abstract. Idempotent-consistent
More informationAlgebraic Approach to Automata Theory
Algebraic Approach to Automata Theory Deepak D Souza Department of Computer Science and Automation Indian Institute of Science, Bangalore. 20 September 2016 Outline 1 Overview 2 Recognition via monoid
More informationDuality in Logic. Duality in Logic. Lecture 2. Mai Gehrke. Université Paris 7 and CNRS. {ε} A ((ab) (ba) ) (ab) + (ba) +
Lecture 2 Mai Gehrke Université Paris 7 and CNRS A {ε} A ((ab) (ba) ) (ab) + (ba) + Further examples - revisited 1. Completeness of modal logic with respect to Kripke semantics was obtained via duality
More informationFinite Universes. L is a fixed-length language if it has length n for some
Finite Universes Finite Universes When the universe is finite (e.g., the interval 0, 2 1 ), all objects can be encoded by words of the same length. A language L has length n 0 if L =, or every word of
More informationTemporal logics and explicit-state model checking. Pierre Wolper Université de Liège
Temporal logics and explicit-state model checking Pierre Wolper Université de Liège 1 Topics to be covered Introducing explicit-state model checking Finite automata on infinite words Temporal Logics and
More informationBüchi Automata and Linear Temporal Logic
Büchi Automata and Linear Temporal Logic Joshua D. Guttman Worcester Polytechnic Institute 18 February 2010 Guttman ( WPI ) Büchi & LTL 18 Feb 10 1 / 10 Büchi Automata Definition A Büchi automaton is a
More informationLecture three: Automata and the algebra-coalgebra duality
Lecture three: Automata and the algebra-coalgebra duality Jan Rutten CWI Amsterdam & Radboud University Nijmegen IPM, Tehran - 13 January 2016 This lecture will explain two diagrams: 1 x c ε σ A r x X
More informationChapter 3. Regular grammars
Chapter 3 Regular grammars 59 3.1 Introduction Other view of the concept of language: not the formalization of the notion of effective procedure, but set of words satisfying a given set of rules Origin
More informationMATH 4107 (Prof. Heil) PRACTICE PROBLEMS WITH SOLUTIONS Spring 2018
MATH 4107 (Prof. Heil) PRACTICE PROBLEMS WITH SOLUTIONS Spring 2018 Here are a few practice problems on groups. You should first work through these WITHOUT LOOKING at the solutions! After you write your
More informationCPS 220 Theory of Computation Pushdown Automata (PDA)
CPS 220 Theory of Computation Pushdown Automata (PDA) Nondeterministic Finite Automaton with some extra memory Memory is called the stack, accessed in a very restricted way: in a First-In First-Out fashion
More informationOn the bisimulation invariant fragment of monadic Σ 1 in the finite
On the bisimulation invariant fragment of monadic Σ 1 in the finite Anuj Dawar 1 and David Janin 2 1 University of Cambridge Computer Laboratory, Cambridge CB3 0FD, UK, anuj.dawar@cl.cam.ac.uk. 2 LaBRI,
More informationHow do regular expressions work? CMSC 330: Organization of Programming Languages
How do regular expressions work? CMSC 330: Organization of Programming Languages Regular Expressions and Finite Automata What we ve learned What regular expressions are What they can express, and cannot
More informationOperators with Compatible Ranges
Filomat : (7), 579 585 https://doiorg/98/fil7579d Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat Operators with Compatible Ranges
More informationVAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0. Contents
VAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0 BENJAMIN LEDEAUX Abstract. This expository paper introduces model theory with a focus on countable models of complete theories. Vaught
More informationOn the Origins of Bisimulation and Coinduction
On the Origins of Bisimulation and Coinduction DAVIDE SANGIORGI University of Bologna, Italy The origins of bisimulation and bisimilarity are examined, in the three fields where they have been independently
More informationIntuitionistic L-Fuzzy Rings. By K. Meena & K. V. Thomas Bharata Mata College, Thrikkakara
Global Journal of Science Frontier Research Mathematics and Decision Sciences Volume 12 Issue 14 Version 1.0 Type : Double Blind Peer Reviewed International Research Journal Publisher: Global Journals
More informationFactorization of weighted EP elements in C -algebras
Factorization of weighted EP elements in C -algebras Dijana Mosić, Dragan S. Djordjević Abstract We present characterizations of weighted EP elements in C -algebras using different kinds of factorizations.
More informationEXPLICIT SOLUTION OF THE OPERATOR EQUATION A X + X A = B
EXPLICIT SOLUTION OF THE OPERATOR EQUATION A X + X A = B Dragan S. Djordjević November 15, 2005 Abstract In this paper we find the explicit solution of the equation A X + X A = B for linear bounded operators
More informationFuzzy Function: Theoretical and Practical Point of View
EUSFLAT-LFA 2011 July 2011 Aix-les-Bains, France Fuzzy Function: Theoretical and Practical Point of View Irina Perfilieva, University of Ostrava, Inst. for Research and Applications of Fuzzy Modeling,
More informationDuality and Automata Theory
Duality and Automata Theory Mai Gehrke Université Paris VII and CNRS Joint work with Serge Grigorieff and Jean-Éric Pin Elements of automata theory A finite automaton a 1 2 b b a 3 a, b The states are
More informationLogical Characterizations of Simulation and Bisimulation for Fuzzy Transition Systems
Logical Characterizations of Simulation and Bisimulation for Fuzzy Transition Systems Hengyang Wu 1 Yuxin Deng 2 1 Information Engineer College, Hangzhou Dianzi University Hangzhou 310018, P.R. China 2
More informationWeighted Automata and Networks
Weighted Automata and Networks Miroslav Ćirić University of Niš, Faculty of Sciences Departments of Computer Science and Mathematics Niš, Serbia miroslavciric@pmfedurs Seminar on Theoretical Computer Science
More informationInner image-kernel (p, q)-inverses in rings
Inner image-kernel (p, q)-inverses in rings Dijana Mosić Dragan S. Djordjević Abstract We define study the inner image-kernel inverse as natural algebraic extension of the inner inverse with prescribed
More informationAn Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California. 2. Background: Semirings and Kleene algebras
An Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California 1. Residuated Lattices with iteration 2. Background: Semirings and Kleene algebras 3. A Gentzen system
More informationON PARTITIONS SEPARATING WORDS. Formal languages; finite automata; separation by closed sets.
ON PARTITIONS SEPARATING WORDS Abstract. Partitions {L k } m k=1 of A+ into m pairwise disjoint languages L 1, L 2,..., L m such that L k = L + k for k = 1, 2,..., m are considered. It is proved that such
More informationAbel-Grassmann s bands. 1. Introduction
Quasigroups and Related Systems 11 (2004), 95 101 Abel-Grassmann s bands Petar V. Protić and Nebojša Stevanović Abstract Abel-Grassmann s groupoids or shortly AG-groupoids have been considered in a number
More informationAntichain Algorithms for Finite Automata
Antichain Algorithms for Finite Automata Laurent Doyen 1 and Jean-François Raskin 2 1 LSV, ENS Cachan & CNRS, France 2 U.L.B., Université Libre de Bruxelles, Belgium Abstract. We present a general theory
More informationSTRUCTURAL THEOREMS FOR (m,n)-quasi-ideal SEMIGROUPS. Petar V. Protić. 1. Introduction and some general properties for (m, n)-quasi ideal semigroups
FACTA UNIVERSITATIS (NIŠ) Ser.Math.Inform. Vol. 30, No 2 (2015), 147 156 STRUCTURAL THEOREMS FOR (m,n)-quasi-ideal SEMIGROUPS Petar V. Protić Abstract. The definitions of (m, n)-ideal and (m, n)-quasi-ideal
More informationStreams and Coalgebra Lecture 1
Streams and Coalgebra Lecture 1 Helle Hvid Hansen and Jan Rutten Radboud University Nijmegen & CWI Amsterdam Representing Streams II, Lorentz Center, Leiden, January 2014 Tutorial Overview Lecture 1 (Hansen):
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 informationDuality in Probabilistic Automata
Duality in Probabilistic Automata Chris Hundt Prakash Panangaden Joelle Pineau Doina Precup Gavin Seal McGill University MFPS May 2006 Genoa p.1/40 Overview We have discovered an - apparently - new kind
More informationBisimulation for Neighbourhood Structures
Bisimulation for Neighbourhood Structures Helle Hvid Hansen 1,2 Clemens Kupke 2 Eric Pacuit 3 1 Vrije Universiteit Amsterdam (VUA) 2 Centrum voor Wiskunde en Informatica (CWI) 3 Universiteit van Amsterdam
More informationFoundations of Informatics: a Bridging Course
Foundations of Informatics: a Bridging Course Week 3: Formal Languages and Semantics Thomas Noll Lehrstuhl für Informatik 2 RWTH Aachen University noll@cs.rwth-aachen.de http://www.b-it-center.de/wob/en/view/class211_id948.html
More informationPseudo MV-Algebras Induced by Functions
International Mathematical Forum, 4, 009, no., 89-99 Pseudo MV-Algebras Induced by Functions Yong Chan Kim Department of Mathematics, Kangnung National University, Gangneung, Gangwondo 10-70, Korea yck@kangnung.ac.kr
More informationNOTES ON AUTOMATA. Date: April 29,
NOTES ON AUTOMATA 1. Monoids acting on sets We say that a monoid S with identity element ɛ acts on a set Q if q(st) = (qs)t and qɛ = q. As with groups, if we set s = t whenever qs = qt for all q Q, then
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 informationIntroduction to generalized topological spaces
@ Applied General Topology c Universidad Politécnica de Valencia Volume 12, no. 1, 2011 pp. 49-66 Introduction to generalized topological spaces Irina Zvina Abstract We introduce the notion of generalized
More informationAUTOMATIC STRUCTURES OF BOUNDED DEGREE REVISITED
The Journal of Symbolic Logic Volume 00, Number 0, XXX 0000 AUTOMATIC STRUCTURES OF BOUNDED DEGREE REVISITED DIETRICH KUSKE AND MARKUS LOHREY Abstract. The first-order theory of a string automatic structure
More informationPartial model checking via abstract interpretation
Partial model checking via abstract interpretation N. De Francesco, G. Lettieri, L. Martini, G. Vaglini Università di Pisa, Dipartimento di Ingegneria dell Informazione, sez. Informatica, Via Diotisalvi
More informationModel Theory of XPath on Data Trees. Part II: Binary Bisimulation and Definability
Model Theory of XPath on Data Trees. Part II: Binary Bisimulation and Definability Sergio Abriola María Emilia Descotte Santiago Figueira University of Buenos Aires Abstract We study the expressive power
More informationFinite homogeneous and lattice ordered effect algebras
Finite homogeneous and lattice ordered effect algebras Gejza Jenča Department of Mathematics Faculty of Electrical Engineering and Information Technology Slovak Technical University Ilkovičova 3 812 19
More informationarxiv: v2 [cs.fl] 15 Dec 2014
1 Determinization of fuzz automata b means of the degrees of language inclusion Ivana Micić, Zorana Jančić, Jelena Ignjatović, and Miroslav Ćirić Abstract arxiv:1410.6063v2 [cs.fl] 15 Dec 2014 1 Introduction
More informationOn Hájek s Fuzzy Quantifiers Probably and Many
On Hájek s Fuzzy Quantifiers Probably and Many Petr Cintula Institute of Computer Science Academy of Sciences of the Czech Republic Lukasiewicz logic L Connectives: implication and falsum (we set ϕ = ϕ
More informationWarshall s algorithm
Regular Expressions [1] Warshall s algorithm See Floyd-Warshall algorithm on Wikipedia The Floyd-Warshall algorithm is a graph analysis algorithm for finding shortest paths in a weigthed, directed graph
More informationClasses and conversions
Classes and conversions Regular expressions Syntax: r = ε a r r r + r r Semantics: The language L r of a regular expression r is inductively defined as follows: L =, L ε = {ε}, L a = a L r r = L r L r
More informationDuality in Logic and Computation
Duality in Logic and Computation Prakash Panangaden 1 1 School of Computer Science McGill University IEEE Symposium On Logic In Computer Science, June 2013 Panangaden (McGill University) Duality in Logic
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 informationNondeterminism. September 7, Nondeterminism
September 7, 204 Introduction is a useful concept that has a great impact on the theory of computation Introduction is a useful concept that has a great impact on the theory of computation So far in our
More informationFormal Definition of a Finite Automaton. August 26, 2013
August 26, 2013 Why a formal definition? A formal definition is precise: - It resolves any uncertainties about what is allowed in a finite automaton such as the number of accept states and number of transitions
More informationNew Weighted Sum Model
Filomat 31:10 (2017), 2991 2998 https://doi.org/10.2298/fil1710991m Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat New Weighted
More informationCharacterizing CTL-like logics on finite trees
Theoretical Computer Science 356 (2006) 136 152 www.elsevier.com/locate/tcs Characterizing CTL-like logics on finite trees Zoltán Ésik 1 Department of Computer Science, University of Szeged, Hungary Research
More informationInterpretability Logic
Interpretability Logic Logic and Applications, IUC, Dubrovnik vukovic@math.hr web.math.pmf.unizg.hr/ vukovic/ Department of Mathematics, Faculty of Science, University of Zagreb September, 2013 Interpretability
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 informationOverlapping tile automata:
Overlapping tile automata: towards a language theory of overlapping structures David Janin LaBRI, Université de Bordeaux Computer Science in Russia, Ekaterinburg, june 2013 1. From strings to overlapping
More informationA note on coinduction and weak bisimilarity for while programs
Centrum voor Wiskunde en Informatica A note on coinduction and weak bisimilarity for while programs J.J.M.M. Rutten Software Engineering (SEN) SEN-R9826 October 31, 1998 Report SEN-R9826 ISSN 1386-369X
More informationConstructing Finite Least Kripke Models for Positive Logic Programs in Serial Regular Grammar Logics
Constructing Finite Least Kripke Models for Positive Logic Programs in Serial Regular Grammar Logics Linh Anh Nguyen Institute of Informatics, University of Warsaw ul. Banacha 2, 02-097 Warsaw, Poland
More informationINTRODUCING MV-ALGEBRAS. Daniele Mundici
INTRODUCING MV-ALGEBRAS Daniele Mundici Contents Chapter 1. Chang subdirect representation 5 1. MV-algebras 5 2. Homomorphisms and ideals 8 3. Chang subdirect representation theorem 11 4. MV-equations
More informationCOMPUTING LOCAL UNIFIERS IN THE DESCRIPTION LOGIC EL WITHOUT THE TOP CONCEPT
Institute of Theoretical Computer Science Chair of Automata Theory COMPUTING LOCAL UNIFIERS IN THE DESCRIPTION LOGIC EL WITHOUT THE TOP CONCEPT Franz Baader Nguyen Thanh Binh Stefan Borgwardt Barbara Morawska
More informationAn Introduction to Modal Logic III
An Introduction to Modal Logic III Soundness of Normal Modal Logics Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, October 24 th 2013 Marco Cerami
More informationTopology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.
Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail: Topology Proceedings Department of Mathematics & Statistics Auburn University, Alabama 36849, USA E-mail: topolog@auburn.edu ISSN: 0146-4124
More informationAutomata-based Verification - III
COMP30172: Advanced Algorithms Automata-based Verification - III Howard Barringer Room KB2.20: email: howard.barringer@manchester.ac.uk March 2009 Third Topic Infinite Word Automata Motivation Büchi Automata
More informationNotes on Monoids and Automata
Notes on Monoids and Automata Uday S. Reddy November 9, 1994 In this article, I define a semantics for Algol programs with Reynolds s syntactic control of interference?;? in terms of comonoids in coherent
More informationDiscrete Mathematics. CS204: Spring, Jong C. Park Computer Science Department KAIST
Discrete Mathematics CS204: Spring, 2008 Jong C. Park Computer Science Department KAIST Today s Topics Sequential Circuits and Finite-State Machines Finite-State Automata Languages and Grammars Nondeterministic
More informationOne-relation languages and ω-code generators
One-relation languages and ω-code generators Tran Vinh Duc, Igor Litovsky I3S Université de Nice - Sophia Antipolis France Journées Montoises d Informatique Théorique AMIENS, 2010 Infinite words Let A
More informationTheory of Computer Science
Theory of Computer Science C1. Formal Languages and Grammars Malte Helmert University of Basel March 14, 2016 Introduction Example: Propositional Formulas from the logic part: Definition (Syntax of Propositional
More informationACS2: Decidability Decidability
Decidability Bernhard Nebel and Christian Becker-Asano 1 Overview An investigation into the solvable/decidable Decidable languages The halting problem (undecidable) 2 Decidable problems? Acceptance problem
More informationNotions of Bisimulation for Heyting-Valued Modal Languages
Notions of Bisimulation for Heyting-Valued Modal Languages Pantelis E. Eleftheriou CMAF, Universidade de Lisboa, Av. Prof. Gama Pinto 2, 1649-003 Lisboa, Portugal pelefthe@gmail.com Costas D. Koutras Department
More informationDefinition: A grammar G = (V, T, P,S) is a context free grammar (cfg) if all productions in P have the form A x where
Recitation 11 Notes Context Free Grammars Definition: A grammar G = (V, T, P,S) is a context free grammar (cfg) if all productions in P have the form A x A V, and x (V T)*. Examples Problem 1. Given the
More informationForeword. Grammatical inference. Examples of sequences. Sources. Example of problems expressed by sequences Switching the light
Foreword Vincent Claveau IRISA - CNRS Rennes, France In the course of the course supervised symbolic machine learning technique concept learning (i.e. 2 classes) INSA 4 Sources s of sequences Slides and
More informationClosure under the Regular Operations
September 7, 2013 Application of NFA Now we use the NFA to show that collection of regular languages is closed under regular operations union, concatenation, and star Earlier we have shown this closure
More informationHelium-rich white dwarf atmospheres: the nonsymmetric ion-atom absorption processes
Journal of Physics: Conference Series OPEN ACCESS Helium-rich white dwarf atmospheres: the nonsymmetric ion-atom absorption processes To cite this article: V A Srekovi et al 014 J. Phys.: Conf. Ser. 565
More informationSupervisory Control: Advanced Theory and Applications
Supervisory Control: Advanced Theory and Applications Dr Rong Su S1-B1b-59, School of EEE Nanyang Technological University Tel: +65 6790-6042, Email: rsu@ntu.edu.sg EE6226, Discrete Event Systems 1 Introduction
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 informationCommutative FSM Having Cycles over the Binary Alphabet
Commutative FSM Having Cycles over the Binary Alphabet Dr.S. Jeya Bharathi 1, Department of Mathematics, Thiagarajar College of Engineering, Madurai, India A.Jeyanthi 2,* Department of Mathematics Anna
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 information1. Draw a parse tree for the following derivation: S C A C C A b b b b A b b b b B b b b b a A a a b b b b a b a a b b 2. Show on your parse tree u,
1. Draw a parse tree for the following derivation: S C A C C A b b b b A b b b b B b b b b a A a a b b b b a b a a b b 2. Show on your parse tree u, v, x, y, z as per the pumping theorem. 3. Prove that
More informationSolvability of Word Equations Modulo Finite Special And. Conuent String-Rewriting Systems Is Undecidable In General.
Solvability of Word Equations Modulo Finite Special And Conuent String-Rewriting Systems Is Undecidable In General Friedrich Otto Fachbereich Mathematik/Informatik, Universitat GH Kassel 34109 Kassel,
More informationOn L-fuzzy syntopogeneous structures
University of Latvia Riga, Latvia 11 th International Conference FSTA2012 Fuzzy Sets: Theory and Applications January 29 - February 3, 2012, Liptovský Ján, Slovakia Contents Introduction and motivation
More informationOn morphisms of lattice-valued formal contexts
On morphisms of lattice-valued formal contexts Sergejs Solovjovs Masaryk University 1/37 On morphisms of lattice-valued formal contexts Sergejs Solovjovs Department of Mathematics and Statistics, Faculty
More informationDISTINGUISHABILITY RELATIONS BETWEEN INITIALIZED NONDETERMINISTIC FSMs. Nina Yevtushenko Tomsk State University, Russia April, 12, 2011
DISTINGUISHABILITY RELATIONS BETWEEN INITIALIZED NONDETERMINISTIC FSMs Nina Yevtushenko Tomsk State University, Russia April, 12, 2011 Outline 1. Why do we need distinguishability relations? 2. External
More informationProperties of Regular Languages. BBM Automata Theory and Formal Languages 1
Properties of Regular Languages BBM 401 - Automata Theory and Formal Languages 1 Properties of Regular Languages Pumping Lemma: Every regular language satisfies the pumping lemma. A non-regular language
More informationAN EXAMPLE OF USING STAR COMPLEMENTS IN CLASSIFYING STRONGLY REGULAR GRAPHS
Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.yu/filomat Filomat 22:2 (2008), 53 57 AN EXAMPLE OF USING STAR COMPLEMENTS IN CLASSIFYING STRONGLY REGULAR
More information