Fundamental Problems of Fuzzy Automata Theory
|
|
- Edward Wood
- 5 years ago
- Views:
Transcription
1 Fundamental Problems of Fuzzy Automata Theory Jelena Ignjatović Department of Computer Science Faculty of Sciences University of Niš, Serbia ARISTOTLE UNIVERSITY OF THESSALONIKI April 2016, Thessaloniki, Greece 1 Jelena Ignjatović General Problems of Fuzzy Automata Theory
2 Fuzzy sets and fuzzy logic Fuzzy logic logic of graded truth or intermediate truth provides a way to express subtle nuances in reasoning successful in modeling uncertainty Structures of truth values has to be ordered the ordering need not be linear operations for modeling logical operations triangular norms and conorms on the real unit interval [0, 1] Gödel, Łukasiewicz and product structure nonlinear structures: complete residuated lattices (incl Brouwerian lattices, Heyting algebras, MV-algebras, BL-algebras, etc) quantales, lattice-ordered monoids, etc 2 Jelena Ignjatović General Problems of Fuzzy Automata Theory
3 Fuzzy vs classical logic Classical Fuzzy logics with Fuzzy logics with Boolean logic linearly ordered more general structures structures of truth values of truth values (not necessarily linearly ordered) two-element structures on [0, 1] residuated lattices, Boolean algebra determined by t-norms quantales, etc 3 Jelena Ignjatović General Problems of Fuzzy Automata Theory
4 Complete residuated lattices Complete residuated lattice a tuplel=(l,,,,, 0, 1) such that (L1) (L,,, 0, 1) is a complete lattice with the least element 0 and the greatest element 1, (L2) (L,, 1) is a commutative monoid with the unit 1, (L3) and satisfy the residuation property: for all x, y, z L, x y z x y z special cases, on [0, 1] with x y=min(x, y) and x y=max(x, y): { x y=max(x+y 1, 0), Łukasiewicz structure: x y=min(1 x+y, 1) { x y=min(x, y), Gödel structure: x y=1 if x y and = y otherwise { x y=x y), product structure: x y=1 if x y and = y x otherwise 4 Jelena Ignjatović General Problems of Fuzzy Automata Theory
5 Fuzzy sets and fuzzy relations Fuzzy sets fuzzy subset of a set A is a functionα:a L equality:α=β α(a)=β(a), for each a A inclusion:α β α(a) β(a), for each a A union and intersection ( ) α i (a)= α i (a), i I i I ( ) α i (a)= α i (a) if A is finite, with A =n, thenαis an n-dimensional fuzzy vector L A the set of all fuzzy subsets of A Fuzzy relations fuzzy relation between sets A and B is a fuzzy subset of A B, ie, a function R : A B L if A and B are finite, A =m and B =n, then R is a m n fuzzy matrix L A B the set of all fuzzy relations between A and B i I i I 5 Jelena Ignjatović General Problems of Fuzzy Automata Theory
6 Fuzzy equivalences and fuzzy quasi-orders a fuzzy relation R L A A is reflexive, if R(a, a)=1, for all a A; symmetric, if R(a, b)=r(b, a), for all a, b A; transitive, if R(a, b) R(b, c) R(a, c), for all a, b, c A Fuzzy equivalence reflexive, symmetric and transitive fuzzy relation for a fuzzy equivalence E on A and a A, a fuzzy subset E a L A defined by E a (b)=e(a, b) is an equivalence class of E determined by a Fuzzy quasi-order reflexive and transitive fuzzy relation for a fuzzy quasi-order Q on A and a A, a fuzzy subset Q a L A defined by Q a (b)=q(a, b) is an afterset of E determined by a 6 Jelena Ignjatović General Problems of Fuzzy Automata Theory
7 Compositions Composition of fuzzy relations (matrix product) for R L A B and S L B C, the composition R S L A C is defined by (R S)(a, c)= R(a, b) S(b, c) Composition of a fuzzy set and a fuzzy relation (vector-matrix products) for R L A B,α L A andβ L B, the compositionsα R L B and R β L A are defined by (α R)(b)= α(a) R(a, b), (R β)(a)= R(a, b) β(b) a A Composition of fuzzy sets (scalar product, dot product) forα,β L A, the compositionα β Lis defined by α β= α(a) β(a) b B a A b B 7 Jelena Ignjatović General Problems of Fuzzy Automata Theory
8 Residuals right residual of T by S (for S L A B, T L A C ): S\T L B C is given by (S\T)(b, c)= S(a, b) T(a, c) a A left residual of T by S (for S L B C, T L A C ): T/S L A B is given by (T/S)(a, b)= S(b, c) T(a, c) residuation property: S T U T S\U S U/T S\U=max{X L B C S X U}, U/T=max{X L A B X S U} other kinds of residuals: fuzzy set by scalar fuzzy set by fuzzy set scalar by fuzzy set fuzzy set by fuzzy relation c C 8 Jelena Ignjatović General Problems of Fuzzy Automata Theory
9 Historical overview Concept of fuzzy automata natural generalization of the concept of non-deterministic automata Močkoř, Bělohlávek, Li and Pedrycz Močkoř fuzzy automata represented as nested systems of non-deterministic automata Bělohlávek deterministic automata with fuzzy sets of final states represented as nested systems of deterministic automata Li and Pedrycz fuzzy automata represented as automata with fuzzy transition relations taking membership values in a lattice ordered monoid Nondeterministic automaton quantuplea=(a, X,δ,σ,τ) A set of states, δ A X A X input alphabet (δ x A A) transition relation (a, x, b) δ (a, b) δ x, for all a, b A, x X σ A, τ A sets of initial and terminal states 9 Jelena Ignjatović General Problems of Fuzzy Automata Theory
10 Nondeterministic automata Transition relations, sets of initial and terminal states represented by Boolean matrices and vectors: δ x = 0 1 1, δ y= 0 0 1, σ=[ ] 0, τ= x, y x x a 0 x y y x a 1 a 2 y Extended transition relations the family{δ u } u X A A defined by δ ε = A, δ ux =δ u δ x (δ uv =δ u δ v ), u, v X, x X X monoid of words over X,ε empty word 10 Jelena Ignjatović General Problems of Fuzzy Automata Theory
11 Nondeterministic automata Successful path start in an initial, terminate in a final state u X is accepted (recognized) word (label of successful path); (σ δ u ) τ Language recognized bya [[A]] X set of all words accepted bya u [[A]] ( a 1, a 2 A) a 1 σ (a 1, a 2 ) δ u a 2 τ [[A]]={u X (σ δ u ) τ }={u X σ δ u τ=1} automataaandbare equivalent if [[A]]=[[B]] 11 Jelena Ignjatović General Problems of Fuzzy Automata Theory
12 Fuzzy automata Fuzzy automaton quantuplea=(a, X,δ,σ,τ) A set of states, X input alphabet δ : A X A L fuzzy transition function σ : A L,τ : A L fuzzy sets of initial and terminal states Fuzzy transition relations the family{δ x } x X L A A defined byδ x (a, b)=δ(a, x, b) the family{δ u } u X L A A defined by δ ε = A, δ ux =δ u δ x (δ uv =δ u δ v ), u, v X, x X Fuzzy language recognized bya [[A]] L X is defined by [[A]](u)=σ δ u τ, for u X fuzzy automataaandbare equivalent if [[A]]=[[B]] 12 Jelena Ignjatović General Problems of Fuzzy Automata Theory
13 Determinization Crisp-deterministic fuzzy automaton (CDFA) δ is a crisp function of A X into A, ie, anyδ u is a crisp function on A σ is a crisp singleton σ={a 0 } τ is a fuzzy set and [[A]](u)=τ(δ u (a 0 )) Fuzzy Seets and Systems, 2010 (Ignjatović, Ćirić, Bogdanović, Petković) extensive study of crisp-deterministic fuzzy automata Determinization problem practical applications of automata mainly require deterministic automata Determinization problem: construct a crisp-deterministic fuzzy automaton equivalent to A crisp noneterministic case: possible exponential growth of the number of states during the determinization fuzzy case: the determinization may even yield an infinite automaton the need for determinization methods that would mitigate the potential enormous growth of the number of states 13 Jelena Ignjatović General Problems of Fuzzy Automata Theory
14 Our determinization methods Fuzzy Seets and Systems, 2008 Nerode automaton ofa Accessible Subset Construction (ASC) A σ = (A σ,σ ε, X,δ σ,τ σ ) A σ ={σ u u X } σ u =σ δ u, for u X (equivalentlyσ ux =σ u δ x ) initial state σ ε =σ, transition function δ σ (σ u, x)=σ ux fuzzy set of final states τ σ (σ u )=σ u τ we build the transition tree of the new CDFA smaller automata than Bělohlávek (INS, 2002), Li and Pedrycz (FSS, 2005) x/0, y/0 a 0 1 x/05, y/1 x/0, y/0 x/1, y/05 a 1 σ e 1 x y 05 1 σ x σ y y x, y x 14 Jelena Ignjatović General Problems of Fuzzy Automata Theory
15 Right and left invariant fuzzy quasi-orders/equivalences Right invariant fuzzy quasi-orders/equivalences fuzzy quasi-orders/equivalences which are solutions to system R τ τ, R δ x δ x R (x X) Left invariant fuzzy quasi-orders/equivalences fuzzy quasi-orders/equivalences which are solutions to system σ R σ, δ x R R δ x (x X) Information Sciences, 2011 (Jančić, Ignjatović, Ćirić) Fuzzy Sets and Systems, 2016 (Jančić, Micić, Ignjatović, Ćirić) Simultaneous determinization and state reduction Q right invariant fuzzy quasi-order A Q = (A Q, Q ε, X,δ Q,τ Q ) A Q ={Q u u X } states Q ε =σ Q, Q ux = Q u δ x Q transitions δ Q (Q u, x)=q ux terminal states τ Q (Q u )=Q u τ 15 Jelena Ignjatović General Problems of Fuzzy Automata Theory
16 Our determinization methods we build the transition tree of the new CDFA in polinomial time Q left invariant fuzzy quasi-order A Q = (A Q, Q ε, X,δ Q,τ Q ) A Q ={Q u u X } states Q ε = Q τ, Q xu = Q δ x Q u transitions δ Q (Q u, x)=q xu terminal states τ Q (Q u )=σ Q u x a 3 a 1 y x, y y x x a 2 y 16 Jelena Ignjatović General Problems of Fuzzy Automata Theory
17 Our determinization methods x, y σ x 2 y σ xyx y x x, y y σ x 2 x x σ x x y σ xy y σ ε x y σ y Q x 2 x y x Q x x y x, y Q xy y x Q ε y Q y A few more methods for determinization of fuzzy automata Determinization of fuzzy automata by means of the degrees of language inclusion Determinization of fuzzy automata using simulations 17 Jelena Ignjatović General Problems of Fuzzy Automata Theory
18 Determinisation and state reduction Further improvement: children automaton related to deterministion using transition sets Q the greatest right invariant fuzzy quasi-order A c Q = (Ac Q, Qc ε, X,δc Q,τc Q ) X={x 1,, x m } finite alphabet A c Q ={Qc u u X } states Q c u = (Q ux 1,, Q uxm, Q u τ) transitions δ c Q (Qc u, x) Q c ux terminal states τ c Q (Qc u)=q u τ 18 Jelena Ignjatović General Problems of Fuzzy Automata Theory
19 Our canonization methods Canonization problem Construction a minimal crisp-deterministic fuzzy automaton equivalent toa Fuzzy Sets and Systems, 2014 (Jančić, Ćirić) Brzozowski type determinization algorithm fuzzy version reversion ASC reversion ASC minimal CDFA canonization by means of the degrees of language inclusion generally faster canonization algorithm 19 Jelena Ignjatović General Problems of Fuzzy Automata Theory
20 State reduction State reduction problem many constructions used in practice cause enormous growth in a number of states determinization Discrete Event Systems: modular approach lead to parallel compositions with large number of states State reduction problem: reduce or minimize the number of states ofa the state minimization of fuzzy automata is computationally hard Practical state reduction problem: replaceaby an equivalent automaton with as small as possible number of states, which need not be minimal but must be effectively computable 20 Jelena Ignjatović General Problems of Fuzzy Automata Theory
21 Factor automata Afterset automata Factor automatona/e ofawrt E E fuzzy equivalence on the set of states A A/E=(A/E, X, T E,σ E,τ E ) A/E={E a a A} factor set or quotient set states σ E (E a )=(σ E)(a) transitions δ E x (E a, E b )=(E δ x E)(a, b) terminal states τ E (E a )=(E τ)(a) Afterset automatona/q a fuzzy equivalence is replaced by a fuzzy quasi-order, and classes by aftersets Fuzzy language recognized bya/q [[A/R]](e)=σ R τ [[A/R]](u)=σ R δ x1 R δ x2 R R δ xn R τ, u=x 1 x 2 x n X 21 Jelena Ignjatović General Problems of Fuzzy Automata Theory
22 The general system The equivalence ofa/q anda The general system A/Q is equivalent toaif and only if Q is a solution to the system σ τ=σ R τ, σ δ x1 δ x2 δ xn τ=σ R δ x1 R δ x2 R R δ xn R τ x 1, x 2,, x n X (R is an unknown taking values in L A A ) The general system it may be hard for solving it may consist of infinitely many equations we have to find as possible greater solutions (greater solutions provide better reductions) in the general case, there is no the greatest solution Instances of the general system systems whose any solution is a solution to the general system we need instances consisting of finitely many equations or inequalities which have the greatest solution 22 Jelena Ignjatović General Problems of Fuzzy Automata Theory
23 Our main results Journal of Computer and System Sciences, 2010 (Ćirić, Stamenković, Ignjatović, Petković) methods for computing the greatest right and left invariant fuzzy equivalences fuzzy equivalences provide better reductions than crisp equivalences alternate reductions by right and left invariant fuzzy equivalences provide even better results fuzzy automaton reduced by the greatest RIFE can not be reduced again by a RIFE, but can by a LIFE, and vice versa Information Sciences, 2014 (Stamenković, Ćirić, Ignjatović) methods for computing the greatest right and left invariant fuzzy quasi-orders fuzzy quasi-orders provide better reductions than fuzzy equivalences alternate reductions by right and left invariant fuzzy quasi-orders applications to FDES conflict analysis of FDES 23 Jelena Ignjatović General Problems of Fuzzy Automata Theory
24 Reduction of fuzzy automata x/0, y/0 x/0, y/1 2 x/0, y/1 x/1, y/1 x/0, y/1 x/1, y/1 x/1, y/1 1 R 1 R 2 x/0, y/0 x/0, y/0 x/0, y/0 x/0, y/1 x/0, y/1 3 x/0, y/0 24 Jelena Ignjatović General Problems of Fuzzy Automata Theory
25 Simulation, bisimulation, equivalence Bisimulation relations originated independently in computer science, modal logic and set theory concurrency theory a means for testing behavioural equivalence among processes, for reduction of the state-space of processes applications: program verification, model checking, functional languages, object-oriented languages, databases, compiler optimization,etc Our contribution we defined two types of simulations for fuzzy automata forward, backward four types of bisimulations forward, backward, forward-backward, backward-forward 25 Jelena Ignjatović General Problems of Fuzzy Automata Theory
26 Equivalent fuzzy automata 1 1 a 1 x/1, y/05 x/1, y/06 x/06, y/ x/07, y/1 x/07, y/1 a 0 b 0 b 1 1 x/03, y/06 x/05, y/06 x/04, y/02 x/04, y/07 x/06, y/07 x/03, y/04 1 x/06, y/07 05 a 2 x/1, y/ Jelena Ignjatović General Problems of Fuzzy Automata Theory
27 Simulation, bisimulation, equivalence Two main roles of bisimulations fuzzy automata theory model the equivalence between states of two different fuzzy automata, reduce the number of states Fuzzy automata A=(A,δ A,σ A,τ A ),B=(B,δ B,σ B,τ B ) ϕ : A B L Forward simulations σ A σ B ϕ 1 ϕ 1 δ A x δb x ϕ 1 ϕ 1 τ A τ B Backward simulations σ A ϕ σ B δ A x ϕ ϕ δb x τ A ϕ τ B 27 Jelena Ignjatović General Problems of Fuzzy Automata Theory
28 Forward and backward simulations ϕ σ 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 x k+2 x n a k+1 b k+1 x k+2 x n τ A a n b n τ B 28 Jelena Ignjatović General Problems of Fuzzy Automata Theory
29 Forward and backward simulations A σ A a 0 x 1 x k a k x k+1 ϕ forward simulation σ B b 0 x 1 B x k b k x k+1 x k+2 x n a k+1 b k+1 x k+2 x n τ A a n b n τ B 28 Jelena Ignjatović General Problems of Fuzzy Automata Theory
30 Forward and backward simulations arbitrary successful run A σ A a 0 x 1 x k a k x k+1 ϕ forward simulation σ B b 0 x 1 B x k b k x k+1 x k+2 x n a k+1 b k+1 x k+2 x n τ A a n b n τ B 28 Jelena Ignjatović General Problems of Fuzzy Automata Theory
31 Forward and backward simulations arbitrary successful run A σ A a 0 x 1 x k a k x k+1 δ A x k+1 ϕ forward simulation σ B b 0 x 1 B x k b k x k+1 x k+2 x n a k+1 b k+1 x k+2 x n τ A a n b n τ B 28 Jelena Ignjatović General Problems of Fuzzy Automata Theory
32 Forward and backward simulations arbitrary successful run A σ A a 0 x 1 x k a k x k+1 x k+2 x n a k+1 δ A x k+1 ϕ forward simulation σ B b 0 x 1 B x k building b k a successful run which simulates x k+1 the original run b k+1 x k+2 x n τ A a n b n τ B 28 Jelena Ignjatović General Problems of Fuzzy Automata Theory
33 Forward and backward simulations arbitrary successful run A σ A a 0 x 1 x k a k x k+1 x k+2 x n a k+1 ϕ δ A x k+1 δ B x k+1 forward simulation σ B b 0 x 1 B x k building b k a successful run which simulates x k+1 the original run b k+1 x k+2 x n τ A a n b n τ B 28 Jelena Ignjatović General Problems of Fuzzy Automata Theory
34 Our main results Fuzzy Sets and Systems, 2012 (Ćirić, Ignjatović, Damljanović, Bašić) Fuzzy Sets and Systems, 2012 (Ćirić, Ignjatović, Jančić, Damljanović) simulations and bisimulations for fuzzy automata algorithms for testing the existence of a simulation/bisimulation between two fuzzy automata, and computing the greatest one bisimulation equivalence of fuzzy automata Information Sciences, 2014 (Ćirić, Ignjatović, Bašić, Jančić) Theoretical Computer Science, 2014 (Damljanović, Ćirić, Ignjatović) simulations and bisimulations for weighted automata over an additively idempotent semiring relative residuation Boolean residuals 29 Jelena Ignjatović General Problems of Fuzzy Automata Theory
35 Our main results THANK YOU FOR YOUR ATTENTION 30 Jelena Ignjatović General Problems of Fuzzy Automata Theory
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 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 informationFUZZY RELATION EQUATIONS AND FUZZY AUTOMATA
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, 18000 Niš, Serbia miroslav.ciric@pmf.edu.rs,
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 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 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 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 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 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 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 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 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 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 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 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 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 informationHellis Tamm Institute of Cybernetics, Tallinn. Theory Seminar, April 21, Joint work with Janusz Brzozowski, accepted to DLT 2011
Theory of Átomata Hellis Tamm Institute of Cybernetics, Tallinn Theory Seminar, April 21, 2011 Joint work with Janusz Brzozowski, accepted to DLT 2011 This work was supported by the Natural Sciences and
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 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 informationOn the filter theory of residuated lattices
On the filter theory of residuated lattices Jiří Rachůnek and Dana Šalounová Palacký University in Olomouc VŠB Technical University of Ostrava Czech Republic Orange, August 5, 2013 J. Rachůnek, D. Šalounová
More informationMonoidal Categories, Bialgebras, and Automata
Monoidal Categories, Bialgebras, and Automata James Worthington Mathematics Department Cornell University Binghamton University Geometry/Topology Seminar October 29, 2009 Background: Automata Finite automata
More informationEmbedding theorems for normal divisible residuated lattices
Embedding theorems for normal divisible residuated lattices Chapman University Department of Mathematics and Computer Science Orange, California University of Siena Department of Mathematics and Computer
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 informationImplications from data with fuzzy attributes vs. scaled binary attributes
Implications from data with fuzzy attributes vs. scaled binary attributes Radim Bělohlávek, Vilém Vychodil Dept. Computer Science, Palacký University, Tomkova 40, CZ-779 00, Olomouc, Czech Republic Email:
More informationAxioms of Kleene Algebra
Introduction to Kleene Algebra Lecture 2 CS786 Spring 2004 January 28, 2004 Axioms of Kleene Algebra In this lecture we give the formal definition of a Kleene algebra and derive some basic consequences.
More informationPolynomial closure and unambiguous product
Polynomial closure and unambiguous product Jean-Eric Pin and Pascal Weil pin@litp.ibp.fr, weil@litp.ibp.fr 1 Introduction This paper is a contribution to the algebraic theory of recognizable languages,
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 informationWeighted Context-Free Grammars over Bimonoids
Weighted Context-Free Grammars over Bimonoids George Rahonis and Faidra Torpari Aristotle University of Thessaloniki, Greece WATA 2018 Leipzig, May 22, 2018 Faidra Torpari (Aristotle University of Thessaloniki)
More informationFuzzy logic Fuzzyapproximate reasoning
Fuzzy logic Fuzzyapproximate reasoning 3.class 3/19/2009 1 Introduction uncertain processes dynamic engineering system models fundamental of the decision making in fuzzy based real systems is the approximate
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 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 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 informationLecturecise 22 Weak monadic second-order theory of one successor (WS1S)
Lecturecise 22 Weak monadic second-order theory of one successor (WS1S) 2013 Reachability in the Heap Many programs manipulate linked data structures (lists, trees). To express many important properties
More informationAn Algebraic Approach to Energy Problems I -Continuous Kleene ω-algebras
Acta Cybernetica 23 (2017) 203 228. An Algebraic Approach to Energy Problems I -Continuous Kleene ω-algebras Zoltán Ésika, Uli Fahrenberg b, Axel Legay c, and Karin Quaas d Abstract Energy problems are
More informationFrom Residuated Lattices to Boolean Algebras with Operators
From Residuated Lattices to Boolean Algebras with Operators Peter Jipsen School of Computational Sciences and Center of Excellence in Computation, Algebra and Topology (CECAT) Chapman University October
More informationKleene Algebra and Arden s Theorem. Anshul Kumar Inzemamul Haque
Kleene Algebra and Arden s Theorem Anshul Kumar Inzemamul Haque Motivation Regular Expression is a Kleene Algebra. We can use the properties and theorems of Kleene Algebra to simplify regular expressions
More informationRepresenting Arithmetic Constraints with Finite Automata: An Overview
Representing Arithmetic Constraints with Finite Automata: An Overview Bernard Boigelot Pierre Wolper Université de Liège Motivation Linear numerical constraints are a very common and useful formalism (our
More informationThe lattice of varieties generated by residuated lattices of size up to 5
The lattice of varieties generated by residuated lattices of size up to 5 Peter Jipsen Chapman University Dedicated to Hiroakira Ono on the occasion of his 7th birthday Introduction Residuated lattices
More informationAutomata, Logic and Games: Theory and Application
Automata, Logic and Games: Theory and Application 1. Büchi Automata and S1S Luke Ong University of Oxford TACL Summer School University of Salerno, 14-19 June 2015 Luke Ong Büchi Automata & S1S 14-19 June
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 informationWhen does a semiring become a residuated lattice?
When does a semiring become a residuated lattice? Ivan Chajda and Helmut Länger arxiv:1809.07646v1 [math.ra] 20 Sep 2018 Abstract It is an easy observation that every residuated lattice is in fact a semiring
More informationCS256/Spring 2008 Lecture #11 Zohar Manna. Beyond Temporal Logics
CS256/Spring 2008 Lecture #11 Zohar Manna Beyond Temporal Logics Temporal logic expresses properties of infinite sequences of states, but there are interesting properties that cannot be expressed, e.g.,
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 informationAlternating nonzero automata
Alternating nonzero automata Application to the satisfiability of CTL [,, P >0, P =1 ] Hugo Gimbert, joint work with Paulin Fournier LaBRI, Université de Bordeaux ANR Stoch-MC 06/07/2017 Control and verification
More informationNFA and regex. the Boolean algebra of languages. regular expressions. Informatics 1 School of Informatics, University of Edinburgh
NFA and regex cl the Boolean algebra of languages regular expressions Informatics The intersection of two regular languages is regular L = even numbers L = odd numbers L = mod L = mod Informatics The intersection
More informationTree Automata and Rewriting
and Rewriting Ralf Treinen Université Paris Diderot UFR Informatique Laboratoire Preuves, Programmes et Systèmes treinen@pps.jussieu.fr July 23, 2010 What are? Definition Tree Automaton A tree automaton
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 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 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 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 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 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 informationApplied Logic. Lecture 3 part 1 - Fuzzy logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw
Applied Logic Lecture 3 part 1 - Fuzzy logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018 1
More informationImplications from data with fuzzy attributes
Implications from data with fuzzy attributes Radim Bělohlávek, Martina Chlupová, and Vilém Vychodil Dept. Computer Science, Palacký University, Tomkova 40, CZ-779 00, Olomouc, Czech Republic Email: {radim.belohlavek,
More informationVarieties Generated by Certain Models of Reversible Finite Automata
Varieties Generated by Certain Models of Reversible Finite Automata Marats Golovkins 1 and Jean-Eric Pin 2 1 Institute of Mathematics and Computer Science, University of Latvia, Raiņa bulv. 29, Riga, Latvia
More informationMV-algebras and fuzzy topologies: Stone duality extended
MV-algebras and fuzzy topologies: Stone duality extended Dipartimento di Matematica Università di Salerno, Italy Algebra and Coalgebra meet Proof Theory Universität Bern April 27 29, 2011 Outline 1 MV-algebras
More informationON SOME BASIC CONSTRUCTIONS IN CATEGORIES OF QUANTALE-VALUED SUP-LATTICES. 1. Introduction
Math. Appl. 5 (2016, 39 53 DOI: 10.13164/ma.2016.04 ON SOME BASIC CONSTRUCTIONS IN CATEGORIES OF QUANTALE-VALUED SUP-LATTICES RADEK ŠLESINGER Abstract. If the standard concepts of partial-order relation
More informationBOOLEAN ALGEBRA INTRODUCTION SUBSETS
BOOLEAN ALGEBRA M. Ragheb 1/294/2018 INTRODUCTION Modern algebra is centered around the concept of an algebraic system: A, consisting of a set of elements: ai, i=1, 2,, which are combined by a set of operations
More informationComputing Spectra via Dualities in the MTL hierarchy
Computing Spectra via Dualities in the MTL hierarchy Diego Valota Department of Computer Science University of Milan valota@di.unimi.it 11th ANNUAL CECAT WORKSHOP IN POINTFREE MATHEMATICS Overview Spectra
More informationFuzzy filters and fuzzy prime filters of bounded Rl-monoids and pseudo BL-algebras
Fuzzy filters and fuzzy prime filters of bounded Rl-monoids and pseudo BL-algebras Jiří Rachůnek 1 Dana Šalounová2 1 Department of Algebra and Geometry, Faculty of Sciences, Palacký University, Tomkova
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 informationThe Complexity of Computing the Behaviour of Lattice Automata on Infinite Trees
The Complexity of Computing the Behaviour of Lattice Automata on Infinite Trees Karsten Lehmann a, Rafael Peñaloza b a Optimisation Research Group, NICTA Artificial Intelligence Group, Australian National
More informationSEPARATING REGULAR LANGUAGES WITH FIRST-ORDER LOGIC
Logical Methods in Computer Science Vol. 12(1:5)2016, pp. 1 30 www.lmcs-online.org Submitted Jun. 4, 2014 Published Mar. 9, 2016 SEPARATING REGULAR LANGUAGES WITH FIRST-ORDER LOGIC THOMAS PLACE AND MARC
More informationFuzzy Sets and Fuzzy Logic
Fuzzy Sets and Fuzzy Logic Crisp sets Collection of definite, well-definable objects (elements). Representation of sets: list of all elements ={x,,x n }, x j X elements with property P ={x x satisfies
More informationCompositions of Tree Series Transformations
Compositions of Tree Series Transformations Andreas Maletti a Technische Universität Dresden Fakultät Informatik D 01062 Dresden, Germany maletti@tcs.inf.tu-dresden.de December 03, 2004 1. Motivation 2.
More informationAdvanced Automata Theory 9 Automatic Structures in General
Advanced Automata Theory 9 Automatic Structures in General Frank Stephan Department of Computer Science Department of Mathematics National University of Singapore fstephan@comp.nus.edu.sg Advanced Automata
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 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 informationFuzzy Sets. Mirko Navara navara/fl/fset printe.pdf February 28, 2019
The notion of fuzzy set. Minimum about classical) sets Fuzzy ets Mirko Navara http://cmp.felk.cvut.cz/ navara/fl/fset printe.pdf February 8, 09 To aviod problems of the set theory, we restrict ourselves
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 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 informationOn the Truth Values of Fuzzy Statements
International Journal of Applied Computational Science and Mathematics. ISSN 2249-3042 Volume 3, Number 1 (2013), pp. 1-6 Research India Publications http://www.ripublication.com/ijacsm.htm On the Truth
More informationComparison of two versions of the Ferrers property of fuzzy interval orders
Comparison of two versions of the Ferrers property of fuzzy interval orders Susana Díaz 1 Bernard De Baets 2 Susana Montes 1 1.Dept. Statistics and O. R., University of Oviedo 2.Dept. Appl. Math., Biometrics
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 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 informationAn Abstract Approach to Consequence Relations
An Abstract Approach to Consequence Relations Francesco Paoli (joint work with P. Cintula, J. Gil Férez, T. Moraschini) SYSMICS Kickoff Francesco Paoli, (joint work with P. Cintula, J. AnGil Abstract Férez,
More informationA Polynomial Algorithm for Uniqueness of Normal Forms of Linear Shallow Term Rewrite Systems 1. Julian Zinn 2 and Rakesh Verma
A Polynomial Algorithm for Uniqueness of Normal Forms of Linear Shallow Term Rewrite Systems 1 Julian Zinn 2 and Rakesh Verma Computer Science Department University of Houston Houston, TX, 77204, USA http://www.cs.uh.edu
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 informationIntroduction to Kleene Algebra Lecture 9 CS786 Spring 2004 February 23, 2004
Introduction to Kleene Algebra Lecture 9 CS786 Spring 2004 February 23, 2004 Completeness Here we continue the program begun in the previous lecture to show the completeness of Kleene algebra for the equational
More informationAutomatic Verification of Parameterized Data Structures
Automatic Verification of Parameterized Data Structures Jyotirmoy V. Deshmukh, E. Allen Emerson and Prateek Gupta The University of Texas at Austin The University of Texas at Austin 1 Outline Motivation
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 informationAperiodic languages and generalizations
Aperiodic languages and generalizations Lila Kari and Gabriel Thierrin Department of Mathematics University of Western Ontario London, Ontario, N6A 5B7 Canada June 18, 2010 Abstract For every integer k
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 informationGeneralising Automaticity to Modal Properties of Finite Structures
Generalising Automaticity to Modal Properties of Finite Structures Anuj Dawar University of Cambridge Computer Laboratory, Cambridge CB3 0FD, UK. anuj.dawar@cl.cam.ac.uk Stephan Kreutzer Institut für Informatik,
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 informationAutomata on Infinite words and LTL Model Checking
Automata on Infinite words and LTL Model Checking Rodica Condurache Lecture 4 Lecture 4 Automata on Infinite words and LTL Model Checking 1 / 35 Labeled Transition Systems Let AP be the (finite) set of
More informationThe Blok-Ferreirim theorem for normal GBL-algebras and its application
The Blok-Ferreirim theorem for normal GBL-algebras and its application Chapman University Department of Mathematics and Computer Science Orange, California University of Siena Department of Mathematics
More informationAlgebras with finite descriptions
Algebras with finite descriptions André Nies The University of Auckland July 19, 2005 Part 1: FA-presentability A countable structure in a finite signature is finite-automaton presentable (or automatic)
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 informationTheoretical Foundations of the UML
Theoretical Foundations of the UML Lecture 17+18: A Logic for MSCs Joost-Pieter Katoen Lehrstuhl für Informatik 2 Software Modeling and Verification Group moves.rwth-aachen.de/teaching/ws-1718/fuml/ 5.
More informationEquivalence of DFAs and NFAs
CS 172: Computability and Complexity Equivalence of DFAs and NFAs It s a tie! DFA NFA Sanjit A. Seshia EECS, UC Berkeley Acknowledgments: L.von Ahn, L. Blum, M. Blum What we ll do today Prove that DFAs
More informationCongruence Boolean Lifting Property
Congruence Boolean Lifting Property George GEORGESCU and Claudia MUREŞAN University of Bucharest Faculty of Mathematics and Computer Science Academiei 14, RO 010014, Bucharest, Romania Emails: georgescu.capreni@yahoo.com;
More informationCompleteness of Star-Continuity
Introduction to Kleene Algebra Lecture 5 CS786 Spring 2004 February 9, 2004 Completeness of Star-Continuity We argued in the previous lecture that the equational theory of each of the following classes
More informationClC (X ) : X ω X } C. (11)
With each closed-set system we associate a closure operation. Definition 1.20. Let A, C be a closed-set system. Define Cl C : : P(A) P(A) as follows. For every X A, Cl C (X) = { C C : X C }. Cl C (X) is
More informationAutomata on linear orderings
Automata on linear orderings Véronique Bruyère Institut d Informatique Université de Mons-Hainaut Olivier Carton LIAFA Université Paris 7 September 25, 2006 Abstract We consider words indexed by linear
More informationFrom Semirings to Residuated Kleene Lattices
Peter Jipsen From Semirings to Residuated Kleene Lattices Abstract. We consider various classes of algebras obtained by expanding idempotent semirings with meet, residuals and Kleene-. An investigation
More informationDiscrete Mathematics
Discrete Mathematics Yi Li Software School Fudan University March 13, 2017 Yi Li (Fudan University) Discrete Mathematics March 13, 2017 1 / 1 Review of Lattice Ideal Special Lattice Boolean Algebra Yi
More informationFuzzy and Rough Sets Part I
Fuzzy and Rough Sets Part I Decision Systems Group Brigham and Women s Hospital, Harvard Medical School Harvard-MIT Division of Health Sciences and Technology Aim Present aspects of fuzzy and rough sets.
More informationFUZZY ATTRIBUTE LOGIC: ATTRIBUTE IMPLICATIONS, THEIR VALIDITY, ENTAILMENT, AND NON-REDUNDANT BASIS 2 PRELIMINARIES
FUZZY ATTRIBUTE LOGIC: ATTRIBUTE IMPLICATIONS, THEIR VALIDITY, ENTAILMENT, AND NON-REDUNDANT BASIS Radim Bělohlávek Vilém Vychodil Dept. Computer Science, Palacký University, Tomkova 40, CZ-779 00, Olomouc,
More information