|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
10th Annual Symposium on Switching and Automata Theory (SWAT 1969)
A characterization of two-way deterministic of classes languages
October 15-October 17
| ASCII Text | x | ||
| A. V. Aho, J. D. Ullman, "A characterization of two-way deterministic of classes languages," Foundations of Computer Science, IEEE Annual Symposium on, pp. 231-239, 10th Annual Symposium on Switching and Automata Theory (SWAT 1969), 1969. | |||
| BibTex | x | ||
| @article{ 10.1109/SWAT.1969.1, author = {A. V. Aho and J. D. Ullman}, title = {A characterization of two-way deterministic of classes languages}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1969}, issn = {0272-4847}, pages = {231-239}, doi = {http://doi.ieeecomputersociety.org/10.1109/SWAT.1969.1}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - A characterization of two-way deterministic of classes languages SN - 0272-4847 SP231 EP239 A1 - A. V. Aho, A1 - J. D. Ullman, PY - 1969 VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
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.
Citation:
A. V. Aho, J. D. Ullman, "A characterization of two-way deterministic of classes languages," focs, pp.231-239, 10th Annual Symposium on Switching and Automata Theory (SWAT 1969), 1969
Usage of this product signifies your acceptance of the Terms of Use.
