Pushdown automata based on lattice-valued logic: closure properties and decision problems

This paper introduces the concept of pushdown automata based on complete residuated lattice-valued logic (for short,  - valued pushdown automata). We consider some closure properties of  -valued pushdown automata, including max and star. Then, we give some fundamental decision problems including the membership-value, the emptiness-value and the finiteness-value problems