Solving weakly linear inequalities for matrices over max-plus semiring and applications to automata theory
|
|
- Ami Reeves
- 5 years ago
- Views:
Transcription
1 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 joint work with Zorana Jančić and Ivana Micić University of Niš, Faculty of Sciences and Mathematics, Niš, Serbia Research supported by Ministry of Education, Science and Technological Development, Republic of Serbia, Grant No Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 1 / 29
2 Semirings were first introduced by H.S. Vandiver in 1934, but implicitly they had appeared earlier in studies on the theory of ideals of rings and on the axiomatization of the natural numbers. The theory of semirings has been developed in five principal directions: pure theoretical investigations; investigations related to theoretical arithmetic and number theory; investigations connected to logic in a broad sense, including non-classical and multi-valued logics, an algebraic approach to some geometrical and topological investigations and to the theory of differential equations; an algebraic tool for some investigations in the theory of automata, in the theory of formal languages, optimization theory and other branches of of applied mathematics. Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 2 / 29
3 Nowadays they have both a well elaborated algebraic theory, as well as important practical applications. K. Glazek, A Guide to the Literature on Semirings and their Applications in Mathematics and Information Science with Complete Bibliography, Springer-Science+Buissines Media, B.V., Among the most studied and applied types of semirings are those with idempotent addition, called additively idempotent semirings. Applications in many areas of mathematics, computer science and operation research: in the theory of automata and formal languages, optimization theory, idempotent analysis, theory of programming languages, data analysis, discrete event systems theory, algebraic modeling of fuzziness and uncertainty, algebra of formal processes, etc. Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 3 / 29
4 An algebraic structure S = (S,,, 0, 1) is called a semiring if: (S1) (S,, 0) is a commutative monoid, (S2) (S,, 1) is a monoid, (S3) multiplication distributes over addition: (x y) z = x z y z, z (x y) = z x z y, x,y,z S, (S4) 0 is absorbing element: 0 x = x 0 = 0, x S. (S5) S is additively idempotent semiring if a a = a, a S. Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 4 / 29
5 Any additively idempotent semiring is naturally ordered by a b a b = b. Every element of an additively idempotent semiring is non-negative, i.e. 0 a. If a semiring fails to be a ring, it is by the absence of additive inverses. Using the natural ordering, it is possible to define in a usual way the notions of upper and lower bounds, bounded sets and M and N, etc. J. S. Golan, Semirings and their Applications, Kluwer Academic Publisher, Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 5 / 29
6 Max-plus semiring is the semiring which the set R max = { } R forms with operations and defined by a b = max(a,b) and a b = a+b, for all a,b R max. The zero element is ε =, i.e., a ε = ε a = a, for every a R max, The unit element is ǫ = 0, i.e., a ǫ = ǫ a = a, for every a R max. The natural order endows R max with a sup-semilattice structure for which a b is the least upper bound of the set {a,b}. Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 6 / 29
7 Residuated semirings A right residual a\b of b by a is the greatest solution (if it exists) of a x b. A left residual b/a of b by a is the greatest solution (if it exists) of x a b. Such residuals need not always exist, but if they exist they are unique; If the semiring is commutative, we need not to make distinction between right and left residuals; We say that the idempotent semiring S is complete if any family has a supremum, and if the product distributes over infinite sums; A complete idempotent semiring is automatically residuated. Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 7 / 29
8 The semiring R max is not complete; A complete idempotent semiring must have a maximal element; It is sufficient to add + (denoted by ) to obtain a complete semiring: R max = R { } {+ }. Since zero is absorbing, in R max holds ε = ε, ( )+(+ ) = (+ )+( ) = ( ). R max can be embedded in the residuated semiring R max : a\b = b/a = b a. Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 8 / 29
9 Matrix residuation Let R p n max and B Rp m max. By a right residual of B by A we mean the greatest solution of the matrix inequality A X B, (1) where X is an unknown matrix taking values in R n m max. Let A R n p max and B Rm p max. By a left residual of B by A we mean the greatest solution of the matrix inequality X A B, (2) where X is an unknown matrix taking values in R m n max. Residuals of Boolean valued relations G. Birkhoff, Approximation to an inverse in the monoid of relations. Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 9 / 29
10 Right residual A\B of B by A p (A\B) ij = A ki \B kj. k=1 Left residual B/A of B by A p (B/A) ij = B ik /A jk. k=1 Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 10 / 29
11 A = , B = A\B = (1\10) (2\8) (2\12) (0\9) (0\10) (1\8) (3\12) (4\9) (2\10) (1\8) (0\12) (1\9) = = Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 11 / 29
12 Weakly linear inequalities Let A R n n max, B Rm m max, Z Rn m max and unknown matrix X Rn m max. (1) X A B X, X Z, (2) A X X B, X Z. Motivation in automata theory, study of state reduction, bisimulation and equivalence of automata. Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 12 / 29
13 Define functions φ (t) : R n m max Rn m max, for t = 1, 2: φ (1) (P) = [B P /A], φ (2) (ρ) = A\P B. A matrix P R n m max is a solution of weakly linear system (t), for t = 1, 2 if and only if it satisfies P φ t (P) and P Z. Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 13 / 29
14 Let {P k } k N be a sequence of R n m max matrices defined inductively by P 1 = Z, P k+1 = P k φ (t) (P k ). The sequence {P k } k N is descending. If there is the least natural number m N such that P m = P m+1, then the matrix P m is the greatest matrix which is solution to weakly linear inequality (t). If the subalgebra generated by {A ij,b ij,z ij } satisfies DCC, then there is the least natural number m N such that P m = P m+1. Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 14 / 29
15 In some situations we do not need solutions to weakly linear matrix inequalities that are matrices over R max, but those that are Boolean matrices. Moreover, in cases where our algorithms for computing the greatest solutions to weakly linears inequalities fail to terminate in a finite number of steps, it is reasonable to search for the greatest Boolean solutions to these systems. They can be understood as some kind of approximations of the solutions. Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 15 / 29
16 For A R p n max and B Rp m max let a Boolean matrix A\B 2n m be defined by (A\B) ij = A i B j. (3) Then for each X 2 n n the following adjunction property holds and A\B is the Boolean right residual of B by A. A X B X A\B, (4) For A R n p max and B R m p max let a Boolean matrix B/A 2 m n be defined by (B/A) ji = A i B j. (5) Then for each ξ 2 m n the following adjunction property holds and B/A is the Boolean left residual of B by A. X A B X B/A, (6) Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 16 / 29
17 If we use Boolean right and left residuals: The sequence {P k } k N is finite and descending. There is the least natural number m N such that P m = P m+1. The matrix P m is the greatest Boolean matrix which is solution to weakly linear inequality (t). Applications Weighted automata theory / Weighted transition systems. Damljanović, Ćirić, Ignjatović, TCS Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 17 / 29
18 Weighted finite automaton over an alphabet X and a semiring S is a quadruple A = (A,δ A,σ A,τ A ), A is a finite non-empty set of states, δ A : A X A S is a weighted transition function, σ S A is an initial weight vector, τ S A is a final weight vector. For each x X we define a weighted transition matrix δ x S A A by δ A x (a,b) = δa (a,x,b) for all a,b A. The behavior of a weighted automaton A = (A,δ A,σ A,τ A ) is the series [A] defined by ([A],u) = σ A δ A u τ A = σ A (a 1 ) δ A u(a 1,a 2 ) τ A (a 2 ), u X. a 1,a 2 A Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 18 / 29
19 Simulations Let A = (A,δ A,σ A,τ A ) and B = (B,δ B,σ B,τ B ) be weighted automata. A Boolean matrix ρ 2 A B is called a forward simulation between A and B if σ A σ B ρ, (fs-1) ρ δ A x δb x ρ, for every x X, (fs-2) ρ τ A τ B. (fs-3) We call ρ a backward simulation between A and B if it is a forward simulation between the reverse automata Ā and B. Bisimulations ρ is forward bisimulation if both ρ and ρ are forward simulations; ρ is backward bisimulation, if both ρ and ρ are backward simulations; If ρ is a forward simulation and ρ is a backward simulation, then ρ is called a forward-backward bisimulation; If ρ is a backward simulation and ρ is a forward simulation, then ρ is called a backward-forward bisimulation. Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 19 / 29
20 ϕ σ 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 τ B For an arbitrary successful run a 0,a 1,...,a n of the automaton A on a word u = x 1 x 2 x n (x 1,x 2,...,x n X) we can built a sequence b 0,b 1,...,b n of states of B which simulates the original run. Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 20 / 29
21 Existence of simulation/bisimulation of a given type between two weighted automata implies behavior inclusion/equivalence between them: (A) If ρ is a simulation, then [A] [B]. (B) If ρ is a bisimulation, then [A] = [B]. Let A = (A,δ A,σ A,τ A ) and B = (B,δ B,σ B,τ B ) be weighted automata. A Boolean matrix ρ 2 A B satisfies conditions (fs-2) and (fs-3) if and only if it satisfies ρ x X[(δ B x ρ )/δ A x], ρ τ A \τ B. (7) Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 21 / 29
22 Now we are ready to prove a theorem which provides a method for testing the existence of a forward simulation between two weighted automata and the construction of the greatest forward simulation, if forward simulations exist. Let A = (A,δ A,σ A,τ A ) and B = (B,δ B,σ B,τ B ) be weighted automata, and let {ρ k } k N 2 A B be a sequence of Boolean matrices defined inductively by ( ) ρ 1 = τ A \τ B [, ρ k+1 = ρ k (δ B x ρ ] k )/δa x, for every k N. (8) Then the following holds: x X (a) The sequence {ρ k } k N is finite and descending, and there is the least natural number m N such that ρ m = ρ m+1 ; (b) ρ m is the greatest Boolean matrix in 2 A B which satisfies (fs-2) and (fs-3); (c) If ρ m satisfies (fs-1), then it is the greatest forward simulation between A and B; (d) If ρ m does not satisfy (fs-1), then there is no forward simulation between A and B. Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 22 / 29
23 Algorithm Computation of the greatest forward simulation The input of this algorithm are weighted automata A = (A,δ A,σ A,τ A ) and B = (B,δ B,σ B,τ B ). The algorithm decides whether there is a forward simulation between A and B, and when it exists, the output of the algorithm is the greatest forward simulation. The procedure is to construct the sequence of Boolean matrices {ρ k } k N : (A1) In the first step we compute τ A \τ B and we set ρ 1 = τ A \τ B. (A2) After the kth step let ρ k be the Boolean matrix that has been constructed. (A3) In the next step we construct the Boolean matrix ρ k+1 by means of the formula (8). (A4) Simultaneously, we check whether ρ k+1 = ρ k. (A5) When we find the smallest number m such that ρ m+1 = ρ m, the procedure of constructing the sequence {ρ k } k N terminates, and we check whether ρ m satisfies (fs-1). If ρ m satisfies (fs-1), then it is the greatest forward simulation between A and B, and if ρ m does not satisfy (fs-1), then there is no any forward simulation between A and B. The algorithm terminates in a finite number of steps. The total computation time for the whole algorithm is O(m A B ( A + B ) X c + ). Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 23 / 29
24 Similarly we can give a procedure which decides whether there exists a forward (or backward-forward) bisimulaton between A and B, and whenever there is at least one such bisimulation, the algorithm computes the greatest one. The only difference is that for forward bisimulations we build the sequence {ρ k } k N by ρ 1 = (τ A \τ B ) (τ A /τ B ), ( [ ρ k+1 = ρ k (δ B x ρ k )/δa x x X ] [ ] ) (δ A x ρ k )/δ B x, (9) and at the final stage of the algorithm, we perform the check using conditions σ A σ B ρ and σ B σ A ρ instead of (fs-1), and in the case of backwardforward bisimulations we build {ρ k } k N by ( [ ] [ ρ 1 = (σ A \σ B ) (τ A /τ B ) ρ k+1 = ρ k (δ A x ρ k )/δ B x δ A x \(ρ k δ B x )]), (10) and in the check at the final stage of the algorithm we use conditions σ B σ A ρ and τ A ρ τ B. x X Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 24 / 29
25 Let A = (A,δ A,σ A,τ A ) and B = (B,δ B,σ B,τ B ) be weighted automata over an alphabet X = {x, y} and the max-plus semiring (R { }, max, +,, 0), with A = 3 and B = 2, which are represented by the following graph: x/10, y/5 x/10, y/3 x/3, y/6 5 a 0 a x/4, y/2 x/4, y/7 x/5, y/3 x/6, y/7 x/3, y/4 x/10, y/6 x/7, y/10 5 x/6, y/6 b 0 b 1 x/6, y/7 1 1 a 2 1 x/7, y/10 Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 25 / 29
26 They can also be represented by the following matrices and vectors: σ A = [ ], δ A x = , δ A y = , τ A = 1 1, σ B = [ 5 0 ], δ B x = [ ] [ ] [ , δ 6 7 B y =, τ 7 10 B =. 1] Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 26 / 29
27 Using the above algorithm the following sequence of Boolean matrices has been constructed: ρ 1 = , ρ 3 = ρ 2 = The matrix ρ 2 satisfies condition (fs-1), so it is the greatest forward simulation between A and B. Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 27 / 29
28 Using the above algorithm the following sequence of Boolean matrices has been constructed: ρ 1 = , ρ 3 = ρ 2 = The matrix ρ 2 satisfies condition (fs-1), so it is the greatest forward simulation between A and B. Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 28 / 29
29 K. Glazek, A Guide to the Literature on Semirings and Their Applications in Mathematics and Information Science, Kluwer Academic Publishers, Dordrecht, S. Golan, Semirings and their Applications, Kluwer Academic Publisher, M. Gondran, M. Minoux, Graphs, Dioids and Semirings, Springer, New York, J. Gunawardena (ed.), Idempotency, Cambridge University Press, P. Butkovič, Max-linear Systems: Theory and Algorithms, Springer, London, V. N. Kolokoltsov, V. P. Maslov, Idempotent Analysis and Its Applications, Kluwer Academic Publishers, Dordrecht, W. Kuich, A. Salomaa, Semirings, Automata, Languages, EATCS Monographs in Theoretical Computer Science, Springer Verlag, U. Hebish, H. J. Weinert, Semirings: Algebraic Theory and Applications in Computer Science, World Scientific, Singapore, Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 28 / 29
30 J. M. Howie, Fundamentals of Semigroup Theory, Oxford University Press, Oxford, C. G. Cassandras, S. Lafortune, Introduction to Discrete Event Systems, Springer, M. Droste, W. Kuich, H. Vogler (eds.), Handbook of Weighted Automata, EATCS Monographs in Theoretical Computer Science, Springer, Berlin, J. Sakarovitch, Elements of Automata Theory, Cambridge University Press, P. Buchholz, Bisimulation relations for weighted automata, Theoretical Computer Science 393 (2008) Y. M. Li, W. Pedrycz, Fuzzy finite automata and fuzzy regular expressions with membership values in lattice ordered monoids, Fuzzy Sets and Systems 156 (2005) M. Ćirić, J. Ignjatović, S. Bogdanović, Uniform fuzzy relations and fuzzy functions, Fuzzy Sets and Systems 160 (2009) Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 28 / 29
31 M. Ćirić, J. Ignjatović, N. Damljanović, M. Bašić, Bisimulations for fuzzy automata, Fuzzy Sets and Systems 186 (2012) M. Ćirić, J. Ignjatović, I. Jančić, N. Damljanović, Computation of the greatest simulations and bisimulations between fuzzy automata, Fuzzy Sets and Systems 208 (2012) N. Damljanović, M. Ćirić, J. Ignjatović, Bisimulations for weighted automata over an additively idempotent semiring, Theoretical computer science, 534 (2014) J. Ignjatović, M. Ćirić, N. Damljanović, I. Jančić, Weakly linear systems of fuzzy relation inequalities: The heterogeneous case, Fuzzy Sets and Systems, 199 (2012) N. Damljanović, M. Ćirić, S. Bogdanović, Congruence openings of additive Green s relations on a semiring, Semigroup Forum 82 (3) (2011) Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 29 / 29
32 Thank you for your attention! Novi Sad, Jun 15-18, 2017 NSAC 2017 Nada Damljanović 29 / 29
FUZZY 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 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 informationSystems 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 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 informationSubdirectly irreducible commutative idempotent semirings
Subdirectly irreducible commutative idempotent semirings Ivan Chajda Helmut Länger Palacký University Olomouc, Olomouc, Czech Republic, email: ivan.chajda@upol.cz Vienna University of Technology, Vienna,
More informationarxiv: v1 [math.ra] 23 Feb 2018
JORDAN DERIVATIONS ON SEMIRINGS OF TRIANGULAR MATRICES arxiv:180208704v1 [mathra] 23 Feb 2018 Abstract Dimitrinka Vladeva University of forestry, bulklohridski 10, Sofia 1000, Bulgaria E-mail: d vladeva@abvbg
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 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 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 informationThe variety of commutative additively and multiplicatively idempotent semirings
Semigroup Forum (2018) 96:409 415 https://doi.org/10.1007/s00233-017-9905-2 RESEARCH ARTICLE The variety of commutative additively and multiplicatively idempotent semirings Ivan Chajda 1 Helmut Länger
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 informationUniversal Algebra for Logics
Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic
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 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 informationA Generalized Eigenmode Algorithm for Reducible Regular Matrices over the Max-Plus Algebra
International Mathematical Forum, 4, 2009, no. 24, 1157-1171 A Generalized Eigenmode Algorithm for Reducible Regular Matrices over the Max-Plus Algebra Zvi Retchkiman Königsberg Instituto Politécnico Nacional,
More informationStojan Bogdanović and Miroslav Ćirić
FILOMAT (Niš) 9:1 (1995), 57 62 POWER SEMIGROUPS THAT ARE ARCHIMEDEAN Stojan Bogdanović and Miroslav Ćirić ABSTRACT. Power semigroups of various semigroups were studied by a number of authors. Here we
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 informationA Solution of a Tropical Linear Vector Equation
A Solution of a Tropical Linear Vector Equation NIKOLAI KRIVULIN Faculty of Mathematics and Mechanics St. Petersburg State University 28 Universitetsky Ave., St. Petersburg, 198504 RUSSIA nkk@math.spbu.ru
More informationVariations of non-additive measures
Variations of non-additive measures Endre Pap Department of Mathematics and Informatics, University of Novi Sad Trg D. Obradovica 4, 21 000 Novi Sad, Serbia and Montenegro e-mail: pape@eunet.yu Abstract:
More informationP-Spaces and the Prime Spectrum of Commutative Semirings
International Mathematical Forum, 3, 2008, no. 36, 1795-1802 P-Spaces and the Prime Spectrum of Commutative Semirings A. J. Peña Departamento de Matemáticas, Facultad Experimental de Ciencias, Universidad
More informationarxiv: v2 [math.oc] 28 Nov 2015
Rating Alternatives from Pairwise Comparisons by Solving Tropical Optimization Problems arxiv:1504.00800v2 [math.oc] 28 Nov 2015 N. Krivulin Abstract We consider problems of rating alternatives based on
More informationEquational Theory of Kleene Algebra
Introduction to Kleene Algebra Lecture 7 CS786 Spring 2004 February 16, 2004 Equational Theory of Kleene Algebra We now turn to the equational theory of Kleene algebra. This and the next lecture will be
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 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 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 informationJournal Algebra Discrete Math.
Algebra and Discrete Mathematics Number 4. (2005). pp. 28 35 c Journal Algebra and Discrete Mathematics RESEARCH ARTICLE Presentations and word problem for strong semilattices of semigroups Gonca Ayık,
More informationMANFRED DROSTE AND WERNER KUICH
Logical Methods in Computer Science Vol. 14(1:21)2018, pp. 1 14 https://lmcs.episciences.org/ Submitted Jan. 31, 2017 Published Mar. 06, 2018 WEIGHTED ω-restricted ONE-COUNTER AUTOMATA Universität Leipzig,
More informationThe presence of a zero in an integer linear recurrent sequence is NP-hard to decide
Linear Algebra and its Applications 351 352 (2002) 91 98 www.elsevier.com/locate/laa The presence of a zero in an integer linear recurrent sequence is NP-hard to decide Vincent D. Blondel a,, Natacha Portier
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 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 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 informationFuzzy relation equations with dual composition
Fuzzy relation equations with dual composition Lenka Nosková University of Ostrava Institute for Research and Applications of Fuzzy Modeling 30. dubna 22, 701 03 Ostrava 1 Czech Republic Lenka.Noskova@osu.cz
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 informationAbout closed-loop control and observability of max-plus linear systems: Application to manufacturing systems
About closed-loop control and observability of max-plus linear systems: Application to manufacturing systems Laurent Hardouin and Xavier David-Henriet perso-laris.univ-angers.fr/~hardouin/ ISTIA-LARIS,
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 informationR S. Publication (rspublication.com), Page 316
BOOLEAN LIKE SEMIRINGS C. Venkata Lakshmi #1, T. Vasanthi #2 #1 Dept. of Applied Mathematics, Sri Padmavati Women s University, Tirupati, A.P., India. #2 Dept. of Applied Mathematics, Yogi Vemana University,
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 informationMinimization of Weighted Automata
Minimization of Weighted Automata Andreas Maletti Universitat Rovira i Virgili Tarragona, Spain Wrocław May 19, 2010 Minimization of Weighted Automata Andreas Maletti 1 In Collaboration with ZOLTÁN ÉSIK,
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 informationOn Regularity of Incline Matrices
International Journal of Algebra, Vol. 5, 2011, no. 19, 909-924 On Regularity of Incline Matrices A. R. Meenakshi and P. Shakila Banu Department of Mathematics Karpagam University Coimbatore-641 021, India
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 informationA Tropical Extremal Problem with Nonlinear Objective Function and Linear Inequality Constraints
A Tropical Extremal Problem with Nonlinear Objective Function and Linear Inequality Constraints NIKOLAI KRIVULIN Faculty of Mathematics and Mechanics St. Petersburg State University 28 Universitetsky Ave.,
More informationA GENERALIZATION OF BI IDEALS IN SEMIRINGS
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 8(2018), 123-133 DOI: 10.7251/BIMVI1801123M Former BULLETIN
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 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 informationON FIELD Γ-SEMIRING AND COMPLEMENTED Γ-SEMIRING WITH IDENTITY
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 8(2018), 189-202 DOI: 10.7251/BIMVI1801189RA Former BULLETIN
More informationF. Blanchet-Sadri and F.D. Gaddis, "On a Product of Finite Monoids." Semigroup Forum, Vol. 57, 1998, pp DOI: 10.
On a Product of Finite Monoids By: F. Blanchet-Sadri and F. Dale Gaddis F. Blanchet-Sadri and F.D. Gaddis, "On a Product of Finite Monoids." Semigroup Forum, Vol. 57, 1998, pp 75-91. DOI: 10.1007/PL00005969
More informationON SOME CLASSES OF TREE AUTOMATA AND TREE LANGUAGES
Annales Academiæ Scientiarum Fennicæ Mathematica Volumen 25, 2000, 325 336 ON SOME CLASSES OF TREE AUTOMATA AND TREE LANGUAGES Ferenc Gécseg József Attila University, Department of Informatics Aradi vértanúk
More informationClosure operators on sets and algebraic lattices
Closure operators on sets and algebraic lattices Sergiu Rudeanu University of Bucharest Romania Closure operators are abundant in mathematics; here are a few examples. Given an algebraic structure, such
More informationMATH 433 Applied Algebra Lecture 22: Semigroups. Rings.
MATH 433 Applied Algebra Lecture 22: Semigroups. Rings. Groups Definition. A group is a set G, together with a binary operation, that satisfies the following axioms: (G1: closure) for all elements g and
More informationJónsson posets and unary Jónsson algebras
Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal
More informationSemigroup invariants of symbolic dynamical systems
Semigroup invariants of symbolic dynamical systems Alfredo Costa Centro de Matemática da Universidade de Coimbra Coimbra, October 6, 2010 Discretization Discretization Discretization 2 1 3 4 Discretization
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationFamily of lattice valued Aleshin type finite state automata
Family of lattice valued Aleshin type finite state automata Dr.A.Jeyanthi, 2 B.Stalin Faculty, 2 Assistant Professor Department of Mathematics, 2 Department of Mechanical Engineering, 2 Anna University,
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 informationApproximating models based on fuzzy transforms
Approximating models based on fuzzy transforms Irina Perfilieva University of Ostrava Institute for Research and Applications of Fuzzy Modeling 30. dubna 22, 701 03 Ostrava 1, Czech Republic e-mail:irina.perfilieva@osu.cz
More informationSemirings for Breakfast
Semirings for Breakfast Marc Pouly marc.pouly@unifr.ch Interdisciplinary Center for Security, Reliability and Trust University of Luxembourg July 2010 Marc Pouly Semirings for Breakfast 1/ 27 Semirings
More informationTHE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS
THE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS A. PILITOWSKA 1 AND A. ZAMOJSKA-DZIENIO 2 Abstract. This paper is devoted to the semilattice ordered V-algebras of the form (A, Ω, +), where
More informationThe Erwin Schrödinger International Boltzmanngasse 9 Institute for Mathematical Physics A-1090 Wien, Austria
ESI The Erwin Schrödinger International Boltzmanngasse 9 Institute for Mathematical Physics A-1090 Wien, Austria Algebras of Lukasiewicz s Logic and their Semiring Reducts A. Di Nola B. Gerla Vienna, Preprint
More informationEquational Logic. Chapter Syntax Terms and Term Algebras
Chapter 2 Equational Logic 2.1 Syntax 2.1.1 Terms and Term Algebras The natural logic of algebra is equational logic, whose propositions are universally quantified identities between terms built up from
More informationFuzzy M-solid subvarieties
International Journal of Algebra, Vol. 5, 2011, no. 24, 1195-1205 Fuzzy M-Solid Subvarieties Bundit Pibaljommee Department of Mathematics, Faculty of Science Khon kaen University, Khon kaen 40002, Thailand
More informationGENERAL AGGREGATION OPERATORS ACTING ON FUZZY NUMBERS INDUCED BY ORDINARY AGGREGATION OPERATORS
Novi Sad J. Math. Vol. 33, No. 2, 2003, 67 76 67 GENERAL AGGREGATION OPERATORS ACTING ON FUZZY NUMBERS INDUCED BY ORDINARY AGGREGATION OPERATORS Aleksandar Takači 1 Abstract. Some special general aggregation
More informationSome Pre-filters in EQ-Algebras
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 12, Issue 2 (December 2017), pp. 1057-1071 Applications and Applied Mathematics: An International Journal (AAM) Some Pre-filters
More informationUniversität Augsburg
Universität Augsburg Properties of Overwriting for Updates in Typed Kleene Algebras Thorsten Ehm Report 2000-7 Dezember 2000 Institut für Informatik D-86135 Augsburg Copyright c Thorsten Ehm Institut für
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 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 informationThe Square of Opposition in Orthomodular Logic
The Square of Opposition in Orthomodular Logic H. Freytes, C. de Ronde and G. Domenech Abstract. In Aristotelian logic, categorical propositions are divided in Universal Affirmative, Universal Negative,
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 informationINSEPARABLE SEQUENCES AND FORCING
Novi Sad J. Math. Vol. 43, No. 2, 2013, 185-189 INSEPARABLE SEQUENCES AND FORCING Boris Šobot 1 Abstract. An inseparable sequence is an almost disjoint family A ξ : ξ < ω 1 of subsets of ω such that for
More informationControl Hierarchies and Tropical Algebras
Control Hierarchies and Tropical Algebras Jörg Raisch 1,2, Xavier David-Henriet 1,2,3, Tom Brunsch 1,3, Laurent Hardouin 3 1 Fachgebiet Regelungssysteme Fakultät Elektrotechnik und Informatik, TU Berlin
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 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 informationModel Theory MARIA MANZANO. University of Salamanca, Spain. Translated by RUY J. G. B. DE QUEIROZ
Model Theory MARIA MANZANO University of Salamanca, Spain Translated by RUY J. G. B. DE QUEIROZ CLARENDON PRESS OXFORD 1999 Contents Glossary of symbols and abbreviations General introduction 1 xix 1 1.0
More informationAtomic effect algebras with compression bases
JOURNAL OF MATHEMATICAL PHYSICS 52, 013512 (2011) Atomic effect algebras with compression bases Dan Caragheorgheopol 1, Josef Tkadlec 2 1 Department of Mathematics and Informatics, Technical University
More informationOn injective constructions of S-semigroups. Jan Paseka Masaryk University
On injective constructions of S-semigroups Jan Paseka Masaryk University Joint work with Xia Zhang South China Normal University BLAST 2018 University of Denver, Denver, USA Jan Paseka (MU) 10. 8. 2018
More informationREGULAR Γ INCLINE AND FIELD Γ SEMIRING
Novi Sad J. Math. Vol. 45, No. 2, 2015, 155-171 REGULAR Γ INCLINE AND FIELD Γ SEMIRING M. Murali Krishna Rao 1 and B. Venkateswarlu 2 Abstract. We introduce the notion of Γ incline as a generalization
More informationSup-t-norm and inf-residuum are a single type of relational equations
International Journal of General Systems Vol. 00, No. 00, February 2011, 1 12 Sup-t-norm and inf-residuum are a single type of relational equations Eduard Bartl a, Radim Belohlavek b Department of Computer
More informationOn Fixed Point Equations over Commutative Semirings
On Fixed Point Equations over Commutative Semirings Javier Esparza, Stefan Kiefer, and Michael Luttenberger Universität Stuttgart Institute for Formal Methods in Computer Science Stuttgart, Germany {esparza,kiefersn,luttenml}@informatik.uni-stuttgart.de
More informationSome decision problems on integer matrices
Some decision problems on integer matrices Christian Choffrut L.I.A.F.A, Université Paris VII, Tour 55-56, 1 er étage, 2 pl. Jussieu 75 251 Paris Cedex France Christian.Choffrut@liafa.jussieu.fr Juhani
More informationLarge deviation convergence of generated pseudo measures
Large deviation convergence of generated pseudo measures Ljubo Nedović 1, Endre Pap 2, Nebojša M. Ralević 1, Tatjana Grbić 1 1 Faculty of Engineering, University of Novi Sad Trg Dositeja Obradovića 6,
More informationRegular Expressions and Language Properties
Regular Expressions and Language Properties Mridul Aanjaneya Stanford University July 3, 2012 Mridul Aanjaneya Automata Theory 1/ 47 Tentative Schedule HW #1: Out (07/03), Due (07/11) HW #2: Out (07/10),
More informationStanford Encyclopedia of Philosophy
Stanford Encyclopedia of Philosophy The Mathematics of Boolean Algebra First published Fri Jul 5, 2002; substantive revision Mon Jul 14, 2014 Boolean algebra is the algebra of two-valued logic with only
More informationTHE FORMAL TRIPLE I INFERENCE METHOD FOR LOGIC SYSTEM W UL
THE FORMAL TRIPLE I INFERENCE METHOD FOR LOGIC SYSTEM W UL 1 MINXIA LUO, 2 NI SANG, 3 KAI ZHANG 1 Department of Mathematics, China Jiliang University Hangzhou, China E-mail: minxialuo@163.com ABSTRACT
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 informationMonadic GMV -algebras
Department of Algebra and Geometry Faculty of Sciences Palacký University of Olomouc Czech Republic TANCL 07, Oxford 2007 monadic structures = algebras with quantifiers = algebraic models for one-variable
More informationON HOW TO CONSTRUCT LEFT SEMIMODULES FROM THE RIGHT ONES
italian journal of pure and applied mathematics n. 32 2014 (561 578) 561 ON HOW TO CONSTRUCT LEFT SEMIMODULES FROM THE RIGHT ONES Barbora Batíková Department of Mathematics CULS Kamýcká 129, 165 21 Praha
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 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 informationAn Introduction to the Theory of Lattice
An Introduction to the Theory of Lattice Jinfang Wang Λy Graduate School of Science and Technology, Chiba University 1-33 Yayoi-cho, Inage-ku, Chiba 263-8522, Japan May 11, 2006 Λ Fax: 81-43-290-3663.
More informationDiameter of the Zero Divisor Graph of Semiring of Matrices over Boolean Semiring
International Mathematical Forum, Vol. 9, 2014, no. 29, 1369-1375 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2014.47131 Diameter of the Zero Divisor Graph of Semiring of Matrices over
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 informationVague Set Theory Applied to BM-Algebras
International Journal of Algebra, Vol. 5, 2011, no. 5, 207-222 Vague Set Theory Applied to BM-Algebras A. Borumand Saeid 1 and A. Zarandi 2 1 Dept. of Math., Shahid Bahonar University of Kerman Kerman,
More informationClasses of Commutative Clean Rings
Classes of Commutative Clean Rings Wolf Iberkleid and Warren Wm. McGovern September 3, 2009 Abstract Let A be a commutative ring with identity and I an ideal of A. A is said to be I-clean if for every
More informationBoolean Inner-Product Spaces and Boolean Matrices
Boolean Inner-Product Spaces and Boolean Matrices Stan Gudder Department of Mathematics, University of Denver, Denver CO 80208 Frédéric Latrémolière Department of Mathematics, University of Denver, Denver
More informationarxiv: v1 [math.lo] 30 Aug 2018
arxiv:1808.10324v1 [math.lo] 30 Aug 2018 Real coextensions as a tool for constructing triangular norms Thomas Vetterlein Department of Knowledge-Based Mathematical Systems Johannes Kepler University Linz
More informationWeighted Finite-State Transducer Algorithms An Overview
Weighted Finite-State Transducer Algorithms An Overview Mehryar Mohri AT&T Labs Research Shannon Laboratory 80 Park Avenue, Florham Park, NJ 0793, USA mohri@research.att.com May 4, 004 Abstract Weighted
More informationPREFERENCE MATRICES IN TROPICAL ALGEBRA
PREFERENCE MATRICES IN TROPICAL ALGEBRA 1 Introduction Hana Tomášková University of Hradec Králové, Faculty of Informatics and Management, Rokitanského 62, 50003 Hradec Králové, Czech Republic e-mail:
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 information