Skip to main navigation Skip to search Skip to main content

Context-free grammars and pushdown automata over infinite alphabets

  • Edward Y.C. Cheng

Student thesis: Master's thesis

Abstract

Context-free grammars and pushdown automata over infinite alphabets are defined. They are natural extensions of the classical ones and possess all their properties.
Date of Award1994
Original languageEnglish
Awarding Institution
  • The Hong Kong University of Science and Technology

Cite this

Links

'