Nondeterministic finite automaton (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Nondeterministic finite automaton" in English language version.

refsWebsite

Global rank English rank

7archive.org

6^th place

4doi.org

2^nd place

1foldoc.org

low place

1ucsd.edu

1,933^rd place

1,342^nd place

1ox.ac.uk

613^th place

456^th place

1web.archive.org

1^st place

1lsv.fr

low place

1worldcat.org

5^th place

archive.org (Global: 6^th place; English: 6^th place)

Hopcroft & Ullman 1979, pp. 19–20. Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages, and Computation (1st ed.). Addison-Wesley. ISBN 0-201-02988-X. (accessible to patrons with print disabilities)
Alfred V. Aho and John E. Hopcroft and Jeffrey D. Ullman (1974). The Design and Analysis of Computer Algorithms. Reading/MA: Addison-Wesley. ISBN 0-201-00029-6.
Sipser 1997, p. 48. Sipser, Michael (1997). Introduction to the Theory of Computation (1st ed.). PWS Publishing. ISBN 978-0-534-94728-6. (accessible to patrons with print disabilities) (See §1.2: Nondeterminism, pp. 47–63.)
Sipser 1997, p. 54. Sipser, Michael (1997). Introduction to the Theory of Computation (1st ed.). PWS Publishing. ISBN 978-0-534-94728-6. (accessible to patrons with print disabilities) (See §1.2: Nondeterminism, pp. 47–63.)
Hopcroft & Ullman 1979, p. 21. Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages, and Computation (1st ed.). Addison-Wesley. ISBN 0-201-02988-X. (accessible to patrons with print disabilities)
Hopcroft & Ullman 1979, p. 25. Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages, and Computation (1st ed.). Addison-Wesley. ISBN 0-201-02988-X. (accessible to patrons with print disabilities)
Hopcroft & Ullman 1979, pp. 26–27. Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages, and Computation (1st ed.). Addison-Wesley. ISBN 0-201-02988-X. (accessible to patrons with print disabilities)

doi.org (Global: 2^nd place; English: 2^nd place)

doi.org

Rabin & Scott 1959. Rabin, M. O.; Scott, D. (April 1959). "Finite Automata and Their Decision Problems". IBM Journal of Research and Development. 3 (2): 114–125. doi:10.1147/rd.32.0114.
Historically shown in: Meyer, A. R.; Stockmeyer, L. J. (1972-10-25). "The equivalence problem for regular expressions with squaring requires exponential space". 13th Annual Symposium on Switching and Automata Theory (Swat 1972). USA: IEEE Computer Society. pp. 125–129. doi:10.1109/SWAT.1972.29. For a modern presentation, see [1]
Álvarez, Carme; Jenner, Birgit (1993-01-04). "A very hard log-space counting class". Theoretical Computer Science. 107 (1): 3–30. doi:10.1016/0304-3975(93)90252-O. ISSN 0304-3975.

dx.doi.org

Álvarez, Carme; Jenner, Birgit (1993-01-04). "A very hard log-space counting class". Theoretical Computer Science. 107 (1): 3–30. doi:10.1016/0304-3975(93)90252-O. ISSN 0304-3975.

foldoc.org (Global: low place; English: low place)

FOLDOC Free Online Dictionary of Computing, Finite-State Machine

lsv.fr (Global: low place; English: low place)

Historically shown in: Meyer, A. R.; Stockmeyer, L. J. (1972-10-25). "The equivalence problem for regular expressions with squaring requires exponential space". 13th Annual Symposium on Switching and Automata Theory (Swat 1972). USA: IEEE Computer Society. pp. 125–129. doi:10.1109/SWAT.1972.29. For a modern presentation, see [1]

ox.ac.uk (Global: 613^th place; English: 456^th place)

abc.comlab.ox.ac.uk

Allan, C., Avgustinov, P., Christensen, A. S., Hendren, L., Kuzins, S., Lhoták, O., de Moor, O., Sereni, D., Sittampalam, G., and Tibble, J. 2005. Adding trace matching with free variables to AspectJ Archived 2009-09-18 at the Wayback Machine. In Proceedings of the 20th Annual ACM SIGPLAN Conference on Object Oriented Programming, Systems, Languages, and Applications (San Diego, CA, USA, October 16–20, 2005). OOPSLA '05. ACM, New York, NY, 345-364.

ucsd.edu (Global: 1,933^rd place; English: 1,342^nd place)

cseweb.ucsd.edu

Chris Calabro (February 27, 2005). "NFA to DFA blowup" (PDF). cseweb.ucsd.edu. Retrieved 6 March 2023.

web.archive.org (Global: 1^st place; English: 1^st place)

Allan, C., Avgustinov, P., Christensen, A. S., Hendren, L., Kuzins, S., Lhoták, O., de Moor, O., Sereni, D., Sittampalam, G., and Tibble, J. 2005. Adding trace matching with free variables to AspectJ Archived 2009-09-18 at the Wayback Machine. In Proceedings of the 20th Annual ACM SIGPLAN Conference on Object Oriented Programming, Systems, Languages, and Applications (San Diego, CA, USA, October 16–20, 2005). OOPSLA '05. ACM, New York, NY, 345-364.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Álvarez, Carme; Jenner, Birgit (1993-01-04). "A very hard log-space counting class". Theoretical Computer Science. 107 (1): 3–30. doi:10.1016/0304-3975(93)90252-O. ISSN 0304-3975.