Scholarlink

In this chapter, we study the pushdown automaton computation model. We learn that the computation power of the pushdown automata is equivalent to that of context-free languages. We also study how to prove that languages are not context-free using the Pumping Lemma and Ogden’s Lemma.

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

The Pushdown Automaton Model

  • 章节

  • 发表日期：

    2025年

查看全文
  • Mitsunori Ogihara

摘要

In this chapter, we study the pushdown automaton computation model. We learn that the computation power of the pushdown automata is equivalent to that of context-free languages. We also study how to prove that languages are not context-free using the Pumping Lemma and Ogden’s Lemma.