2012Unpublished venueRequires access

Adding a Stack to a NFA: Pushdown Automata

George Tourlakis

Open publisher page 0 citations

Abstract

This chapter contains sections titled: The PDA PDA Computations The PDA-acceptable Languages are the Context Free Languages Non Context Free Languages; Another Pumping Lemma Additional Exercises

About this research paper

What this paper is about

This chapter contains sections titled: The PDA PDA Computations The PDA-acceptable Languages are the Context Free Languages Non Context Free Languages; Another Pumping Lemma Additional Exercises

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This chapter contains sections titled: The PDA PDA Computations The PDA-acceptable Languages are the Context Free Languages Non Context Free Languages; Another Pumping Lemma Additional Exercises

Key concepts: Pushdown automaton, Context-free language, Computer science, Embedded pushdown automaton, Pumping lemma for regular languages, Stack (abstract data type), Programming language, Context (archaeology)

Related papers

Back to paper searchBrowse research topicsOriginal source
Adding a Stack to a NFA: Pushdown Automata — Research Paper | ScholarLens