Title :
R70-21 Time and Tape Complexity of Pushdown Automaton Languages
fDate :
7/1/1970 12:00:00 AM
Abstract :
This paper is concerned with the recognition of words which are contained in languages defined by pushdown store machines. Such languages exhibit many of the syntactic properties of algorithmic programming languages. Thus the recognition problem for languages generated by pushdown store machines is related to compilation of programming languages.
Keywords :
Automata; Automatic control; Computer languages; Heart; Personal digital assistants; Switching circuits; Telephony; Turing machines;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/T-C.1970.223008
