Title :
Recognition of context-free and stack languages
Abstract :
This paper is concerned with the recognition of Context-free and deterministic 1-way stack (sa) languages, using n-dimensional Iterative Finitestate Automata (n-D IFA). A problem posed by Cole3 is also answered.
Keywords :
Automata; Magnetic heads; Printing;
Conference_Titel :
Switching and Automata Theory, 1969., IEEE Conference Record of 10th Annual Symposium on
Conference_Location :
Waterloo, ON, Canada
DOI :
10.1109/SWAT.1969.18
