Context-free grammars and pushdown automata over infinite alphabets
by Edward Y.C. Cheng
THESIS
1994
M.Phil. Computer science
vii, 44 leaves : ill. ; 30 cm
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.
Post a Comment