A comment on “Automata theory based on complete residuated lattice-valued logic: Pushdown automata”

2012 ◽  
Vol 199 ◽  
pp. 130-135 ◽  
Author(s):  
Xiuhong Guo
Keyword(s):  
Residuated Lattice ◽  
Automata Theory ◽  
Complete Residuated Lattice ◽  
Pushdown Automata

l-Valued multiset automata and l-valued multiset languages

2020 ◽  
pp. 1-15
Author(s):  
Vinay Gautam
Keyword(s):  
Finite Automaton ◽  
Residuated Lattice ◽  
Regular Languages ◽  
Automata Theory ◽  
Necessary And Sufficient Condition ◽  
Zero Divisors ◽  
Complete Residuated Lattice ◽  
Pumping Lemma ◽  
Deterministic Formula ◽  
Necessary And Sufficient

The reason for this work is to present and study deterministic multiset automata, multiset automata and their languages with membership values in complete residuated lattice without zero divisors. We build up the comparability of deterministic [Formula: see text]-valued multiset finite automaton and [Formula: see text]-valued multiset finite automaton in sense of recognizability of a [Formula: see text]-valued multiset language. Then, we relate multiset regular languages to a given [Formula: see text]-valued multiset regular languages and vice versa. At last, we present the concept of pumping lemma for [Formula: see text]-valued multiset automata theory, which we utilize to give a necessary and sufficient condition for a [Formula: see text]-valued multiset language to be non-constant.

Equivalence in automata theory based on complete residuated lattice-valued logic

2007 ◽  
Vol 158 (13) ◽  
pp. 1407-1422 ◽  
Author(s):  
Hongyan Xing ◽  
Daowen Qiu ◽  
Fuchun Liu ◽  
Zhujun Fan
Keyword(s):  
Residuated Lattice ◽  
Automata Theory ◽  
Complete Residuated Lattice

Fuzzy roughness of n-ary hypergroups based on a complete residuated lattice

2010 ◽  
Vol 20 (1) ◽  
pp. 41-57 ◽  
Author(s):  
Yunqiang Yin ◽  
Jianming Zhan ◽  
P. Corsini
Keyword(s):  
Residuated Lattice ◽  
Complete Residuated Lattice
Sign in / Sign up

Export Citation Format

Share Document