Advertisement

Pushdown Automata, Context Free Grammars and Languages

  • Barbara H. Partee
  • Alice Ter Meulen
  • Robert E. Wall
Part of the Studies in Linguistics and Philosophy book series (SLAP, volume 30)

Abstract

We turn next to a class of automata which are more powerful than the finite automata in the sense that they accept a larger class of languages. These are the pushdown automata (pda’s).

Keywords

Regular Language Finite Automaton Parse Tree Context Free Grammar Context Free Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1993

Authors and Affiliations

  • Barbara H. Partee
    • 1
  • Alice Ter Meulen
    • 2
  • Robert E. Wall
    • 3
  1. 1.Department of LinguisticsUniversity of MassachusettsAmherstUSA
  2. 2.Departments of Philosophy and LinguisticsIndiana UniversityBloomingtonUSA
  3. 3.Department of LinguisticsUniversity of TexasAustinUSA

Personalised recommendations