Find an "empty-cell acceptor" PDA that supports the language 𝐿 = {{𝑎𝑛𝑏𝑛} ∪ {
Posted: Thu Jun 02, 2022 8:34 am
Find an "empty-cell acceptor" PDA that supports the
language
𝐿 = {{𝑎𝑛𝑏𝑛} ∪ {𝑎𝑛𝑏2𝑛} |
𝑛 ∈ ℕ}. Is your PDA deterministic? If not, could you convert your
PDA into a DPDA?
language
𝐿 = {{𝑎𝑛𝑏𝑛} ∪ {𝑎𝑛𝑏2𝑛} |
𝑛 ∈ ℕ}. Is your PDA deterministic? If not, could you convert your
PDA into a DPDA?