Scholarlink

<p>This paper presents lattice-valued multiset pushdown automata over distributive lattices and examines their transition dynamics through illustrative examples. We define lattice-valued multiset language acceptance by lattice-valued multiset pushdown automata using both empty stack and final state, demonstrating their equivalence. Additionally, we classify various types of lattice-valued multiset pushdown automata based on whether their initial and final states are crisp or fuzzy or not classiified, proving that these variants possess same computational power.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

On lattice-valued multiset pushdown automata

  • 期刊论文

  • 发表日期：

    2025年1月23日

查看全文
  • Mallika Dhingra,
  • M. K. Dubey

摘要

This paper presents lattice-valued multiset pushdown automata over distributive lattices and examines their transition dynamics through illustrative examples. We define lattice-valued multiset language acceptance by lattice-valued multiset pushdown automata using both empty stack and final state, demonstrating their equivalence. Additionally, we classify various types of lattice-valued multiset pushdown automata based on whether their initial and final states are crisp or fuzzy or not classiified, proving that these variants possess same computational power.