One-Way Tape Determinsitic PDA
Dr. Rajesh Kumar · Revista Electronica de Veterinaria · 2024
An automata with a tape is known as a pushdown automata (PDA). A pushdown automation has anadvantage of scanning the alphabets of its tape without deleting its content. A one-way tape deterministic pushdownautomata (DPDA) is considered in this paper. In this paper, it is presented that L(R) ={w| x ∈ R,wx ∈ L} where R is aset of symbols and a language L accepted by a PDA. On the basis of a corollary, the terminal symbols are not requiredon the alphabet set of DPDA. In this paper it is also presented that Max(L) = {w| x ∈ R,wx ∈ L} is accepted by a DPDAonly and only if L is accepted by a DPDA.