10th Annual Symposium on Switching and Automata Theory (swat 1969) (1969)
Oct. 15, 1969 to Oct. 17, 1969
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SWAT.1969.18
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.
S. R. Kosaraju, "Recognition of context-free and stack languages," 10th Annual Symposium on Switching and Automata Theory (swat 1969)(FOCS), vol. 00, no. , pp. 129-132, 1969.