scholarly journals Residuated Lattices, Regular Languages, and Burnside Problem

10.29007/76p1 ◽  
2018 ◽  
Author(s):  
Rostislav Horcik

In this talk we are going to explore an interesting connection between the famous Burnside problem for groups, regular languages, and residuated lattices.

2002 ◽  
Vol 13 (01) ◽  
pp. 145-159 ◽  
Author(s):  
GIOVANNI PIGHIZZINI ◽  
JEFFREY SHALLIT

In this paper we give the cost, in terms of states, of some basic operations (union, intersection, concatenation, and Kleene star) on regular languages in the unary case (where the alphabet contains only one symbol). These costs are given by explicitly determining the number of states in the noncyclic and cyclic parts of the resulting automata. Furthermore, we prove that our bounds are optimal. We also present an interesting connection to Jacobsthal's function from number theory.


1998 ◽  
Author(s):  
Laura Firoiu ◽  
Tim Oates ◽  
Paul R. Cohen

Studia Logica ◽  
2021 ◽  
Author(s):  
D. Fazio ◽  
A. Ledda ◽  
F. Paoli

AbstractThe variety of (pointed) residuated lattices includes a vast proportion of the classes of algebras that are relevant for algebraic logic, e.g., $$\ell $$ ℓ -groups, Heyting algebras, MV-algebras, or De Morgan monoids. Among the outliers, one counts orthomodular lattices and other varieties of quantum algebras. We suggest a common framework—pointed left-residuated $$\ell $$ ℓ -groupoids—where residuated structures and quantum structures can all be accommodated. We investigate the lattice of subvarieties of pointed left-residuated $$\ell $$ ℓ -groupoids, their ideals, and develop a theory of left nuclei. Finally, we extend some parts of the theory of join-completions of residuated $$\ell $$ ℓ -groupoids to the left-residuated case, giving a new proof of MacLaren’s theorem for orthomodular lattices.


1987 ◽  
Vol 18 (3) ◽  
pp. 41-45
Author(s):  
A J Dos Reis
Keyword(s):  

1991 ◽  
Vol 22 (3) ◽  
pp. 52-54 ◽  
Author(s):  
Sheng Yu ◽  
Qingyu Zhuang

Author(s):  
ALEXANDER GRISHKOV ◽  
LIUDMILA SABININA ◽  
EFIM ZELMANOV

Abstract We prove that for positive integers $m \geq 1, n \geq 1$ and a prime number $p \neq 2,3$ there are finitely many finite m-generated Moufang loops of exponent $p^n$ .


1981 ◽  
Vol 4 (1) ◽  
pp. 135-149
Author(s):  
J. Albert ◽  
H.A. Maurer ◽  
Th. Ottmann

We present necessary and sufficient conditions for an OL form F to generate regular languages only. The conditions at issue can be effectively checked, whence the “regularity problem for OL forms” is proven decidable.


Sign in / Sign up

Export Citation Format

Share Document