Read-only Turing machine (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Read-only Turing machine" in English language version.

refsWebsite

Global rank English rank

2web.archive.org

1^st place

1^st place

2^nd place

2^nd place

6^th place

6^th place

207^th place

136^th place

1semanticscholar.org

11^th place

8^th place

3,153^rd place

2,332^nd place

1,151^st place

930^th place

archive.org

Kozen, Dexter C. (1997) [1951]. David Gries, Fred B. Schneider (ed.). Automata and Computability (hardcover). Undergraduate Texts in Computer Science (1 ed.). New York: Springer-Verlag. pp. 158, 210, 224. ISBN 978-0-387-94907-9.

doi.org

Kondacs, A.; J. Watrous (1997). "On the power of quantum finite state automata". Proceedings 38th Annual Symposium on Foundations of Computer Science. pp. 66–75. CiteSeerX 10.1.1.49.6392. doi:10.1109/SFCS.1997.646094. ISBN 978-0-8186-8197-4. S2CID 14025116. Archived from the original on 2007-08-23. Retrieved 2007-11-07.
Dwork, Cynthia; Stockmeyer, Larry (1990). "A Time Complexity Gap For 2-Way Probabilistic Finite State Automata". SIAM Journal on Computing. 19 (6): 1011–1023. doi:10.1137/0219069. Archived from the original on 2009-10-28. Retrieved 2007-11-07.

geocities.com

Dwork, Cynthia; Stockmeyer, Larry (1990). "A Time Complexity Gap For 2-Way Probabilistic Finite State Automata". SIAM Journal on Computing. 19 (6): 1011–1023. doi:10.1137/0219069. Archived from the original on 2009-10-28. Retrieved 2007-11-07.

psu.edu

citeseerx.ist.psu.edu

Kondacs, A.; J. Watrous (1997). "On the power of quantum finite state automata". Proceedings 38th Annual Symposium on Foundations of Computer Science. pp. 66–75. CiteSeerX 10.1.1.49.6392. doi:10.1109/SFCS.1997.646094. ISBN 978-0-8186-8197-4. S2CID 14025116. Archived from the original on 2007-08-23. Retrieved 2007-11-07.

semanticscholar.org

api.semanticscholar.org

Kondacs, A.; J. Watrous (1997). "On the power of quantum finite state automata". Proceedings 38th Annual Symposium on Foundations of Computer Science. pp. 66–75. CiteSeerX 10.1.1.49.6392. doi:10.1109/SFCS.1997.646094. ISBN 978-0-8186-8197-4. S2CID 14025116. Archived from the original on 2007-08-23. Retrieved 2007-11-07.

uwaterloo.ca

cs.uwaterloo.ca

Kondacs, A.; J. Watrous (1997). "On the power of quantum finite state automata". Proceedings 38th Annual Symposium on Foundations of Computer Science. pp. 66–75. CiteSeerX 10.1.1.49.6392. doi:10.1109/SFCS.1997.646094. ISBN 978-0-8186-8197-4. S2CID 14025116. Archived from the original on 2007-08-23. Retrieved 2007-11-07.

web.archive.org

Kondacs, A.; J. Watrous (1997). "On the power of quantum finite state automata". Proceedings 38th Annual Symposium on Foundations of Computer Science. pp. 66–75. CiteSeerX 10.1.1.49.6392. doi:10.1109/SFCS.1997.646094. ISBN 978-0-8186-8197-4. S2CID 14025116. Archived from the original on 2007-08-23. Retrieved 2007-11-07.
Dwork, Cynthia; Stockmeyer, Larry (1990). "A Time Complexity Gap For 2-Way Probabilistic Finite State Automata". SIAM Journal on Computing. 19 (6): 1011–1023. doi:10.1137/0219069. Archived from the original on 2009-10-28. Retrieved 2007-11-07.