2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1969)
Oct. 15, 1969 to Oct. 17, 1969
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SWAT.1969.1
It is shown that a class of languages is defined by a class of two-way deterministic balloon automata if and only if that class is closed under marked union, marked Kleene closure and the inverse mappings performed by GSM's that move two ways on the input. Hence, the context sensitive languages and various time and tape complexity classes are equivalent to classes of 2DBA.
J. D. Ullman, A. V. Aho, "A characterization of two-way deterministic of classes languages", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 231-239, 1969, doi:10.1109/SWAT.1969.1