English
Related papers

Related papers: Duality of Lattices Associated to Left and Right Q…

200 papers

A (left) quotient of a language $L$ by a word $w$ is the language $w^{-1}L=\{x\mid wx\in L\}$. The quotient complexity of a regular language $L$ is the number of quotients of $L$; it is equal to the state complexity of $L$, which is the…

Formal Languages and Automata Theory · Computer Science 2015-05-26 Janusz Brzozowski , Sylvie Davies

An atom of a regular language L with n (left) quotients is a non-empty intersection of uncomplemented or complemented quotients of L, where each of the n quotients appears in a term of the intersection. The quotient complexity of L, which…

Formal Languages and Automata Theory · Computer Science 2012-03-09 Janusz Brzozowski , Hellis Tamm

In this paper, the definitions of algebras of quotients and Martandale-like qoutients of Leibniz algebras are introduced and the interactions between the two quotients are determined. Firstly, some important properties which not only hold…

Rings and Algebras · Mathematics 2020-10-13 Chenrui Yao , Yao Ma , Liming Tang , Liangyun Chen

Properties of metrics and pairs consisting of left and right connections are studied on the bimodules of differential 1-forms. Those bimodules are obtained from the derivation based calculus of an algebra of matrix valued functions, and an…

q-alg · Mathematics 2009-10-30 L. Dcabrowski , P. M. Hajac , G. Landi , P. Siniscalco

The binary products of right, left or double division in semigroups that are semilattices of groups give interesting groupoid structures that are in one to one correspondence with semigroups that are semilattices of groups. This work is…

Rings and Algebras · Mathematics 2019-04-03 R. A. R. Monzo

Bilattices (that is, sets with two lattice structures) provide an algebraic tool to model simultaneously the validity of, and knowledge about, sentences in an appropriate language. In particular, certain bilattices have been used to model…

Rings and Algebras · Mathematics 2013-11-13 L. M. Cabrer , A. P. K. Craig , H. A. Priestley

Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…

Group Theory · Mathematics 2018-11-14 Benjamin Linowitz , D. B. McReynolds , Nicholas Miller

A right ideal is a language L over an alphabet A that satisfies L = LA*. We show that there exists a stream (sequence) (R_n : n \ge 3) of regular right ideal languages, where R_n has n left quotients and is most complex under the following…

Formal Languages and Automata Theory · Computer Science 2013-11-19 Janusz Brzozowski , Gareth Davies

The natural join and the inner union combine in different ways tables of a relational database. Tropashko [18] observed that these two operations are the meet and join in a class of lattices-called the relational lattices- and proposed…

Logic in Computer Science · Computer Science 2016-02-29 Luigi Santocanale

In this paper we examine how the notion of algebra of quotients for Lie algebras ties up with the corresponding well-known concept in the associative case. Specifically, we completely characterize when a Lie algebra $Q$ is an algebra of…

Rings and Algebras · Mathematics 2007-05-23 Francesc Perera , Mercedes Siles Molina

This article focuses on the relationship between pseudo-t-norms and the structure of lattices. First, we establish a necessary and sufficient condition for the existence of a left-continuous t-norm on the ordinal sum of two disjoint…

Representation Theory · Mathematics 2025-06-10 Peng He , Xue-ping Wang

We develop a canonical pairing between trees and graphs, which passes to their quotients by Jacobi identities. This pairing is an effective and simple tool for understanding the Lie and Poisson operads, providing canonical duals. In the…

Quantum Algebra · Mathematics 2007-05-23 Dev P. Sinha

This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…

Logic in Computer Science · Computer Science 2018-07-23 Kevin H. Knuth

The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presented. Since state complexity is a property of a language, it is…

Formal Languages and Automata Theory · Computer Science 2009-07-28 Janusz Brzozowski

We prove duality between the left and right fractional derivatives, independently on the type of fractional operator. Main result asserts that the right derivative of a function is the dual of the left derivative of the dual function or,…

Optimization and Control · Mathematics 2014-12-05 M. Cristina Caputo , Delfim F. M. Torres

In this paper we study prime, maximal and two--class congruences from the point of view of the relationships between them in various kinds of universal algebras, as well as their direct and inverse images through morphisms. This research…

Rings and Algebras · Mathematics 2016-07-26 Claudia Mureşan

Complemented lattices and uniquely complemented lattices are very important, not only in mathematics, but also in physics, biology, and even in social sciences. They have been investigated for a long time, especially by Huntington,…

History and Overview · Mathematics 2023-08-10 Daniel Parrochia

In this paper, we introduce the notion of algebras of quotients of Hom-Lie algebras and investigate some properties which can be lifted from a Hom-Lie algebra to its algebra of quotients. We also give some necessary and sufficient…

Rings and Algebras · Mathematics 2020-08-03 Chenrui Yao , Liangyun Chen

This paper provides a fresh perspective on the representation of distributive bilattices and of related varieties. The techniques of naturalduality are employed to give, economically and in a uniform way, categories ofstructures dually…

Rings and Algebras · Mathematics 2014-01-16 L. M. Cabrer , H. A. Priestley

Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…

Logic in Computer Science · Computer Science 2020-04-14 Patrick Cegielski , Serge Grigorieff , Irene Guessarian
‹ Prev 1 2 3 10 Next ›