Regular language (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Regular language" in English language version.

Last modified: 22:03:30, 15 August 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

107books.google.com

3^rd place

76doi.org

2^nd place

65zbmath.org

2,089^th place

1,141^st place

44stackexchange.com

4,114^th place

3,027^th place

22mit.edu

476^th place

340^th place

11rand.org

3,236^th place

2,152^nd place

11sciencedirect.com

137^th place

146^th place

11springer.com

182^nd place

172^nd place

11ams.org

434^th place

249^th place

11semanticscholar.org

15^th place

8^th place

11worldcat.org

4^th place

11ens-cachan.fr

low place

11archive.org

6^th place

ams.org (Global: 434^th place; English: 249^th place)

mathscinet.ams.org

Furst, Merrick; Saxe, James B.; Sipser, Michael (1984). "Parity, circuits, and the polynomial-time hierarchy". Mathematical Systems Theory. 17 (1): 13–27. doi:10.1007/BF01744431. MR 0738749. S2CID 14677270.

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

Straubing, Howard (1994). Finite automata, formal logic, and circuit complexity. Progress in Theoretical Computer Science. Basel: Birkhäuser. p. 8. ISBN 3-7643-3719-2. Zbl 0816.68086.

books.google.com (Global: 3^rd place; English: 3^rd place)

Ruslan Mitkov (2003). The Oxford Handbook of Computational Linguistics. Oxford University Press. p. 754. ISBN 978-0-19-927634-9.
Mark V. Lawson (2003). Finite Automata. CRC Press. pp. 98–103. ISBN 978-1-58488-255-8.
Sheng Yu (1997). "Regular languages". In Grzegorz Rozenberg; Arto Salomaa (eds.). Handbook of Formal Languages: Volume 1. Word, Language, Grammar. Springer. p. 41. ISBN 978-3-540-60420-4.
Robert Sedgewick; Kevin Daniel Wayne (2011). Algorithms. Addison-Wesley Professional. p. 794. ISBN 978-0-321-57351-3.
Jean-Paul Allouche; Jeffrey Shallit (2003). Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press. p. 129. ISBN 978-0-521-82332-6.
Kenneth Rosen (2011). Discrete Mathematics and Its Applications 7th edition. McGraw-Hill Science. pp. 873–880.
Horst Bunke; Alberto Sanfeliu (January 1990). Syntactic and Structural Pattern Recognition: Theory and Applications. World Scientific. p. 248. ISBN 978-9971-5-0566-0.

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

Noam Chomsky (1959). "On Certain Formal Properties of Grammars" (PDF). Information and Control. 2 (2): 137–167. doi:10.1016/S0019-9958(59)90362-6. Here: Definition 8, p.149
Fellows, Michael R.; Langston, Michael A. (1991). "Constructivity issues in graph algorithms". In Myers, J. Paul Jr.; O'Donnell, Michael J. (eds.). Constructivity in Computer Science, Summer Symposium, San Antonio, Texas, USA, June 19-22, Proceedings. Lecture Notes in Computer Science. Vol. 613. Springer. pp. 150–158. doi:10.1007/BFB0021088. ISBN 978-3-540-55631-2.
Weyer, Mark (2002). "Decidability of S1S and S2S". Automata, Logics, and Infinite Games. Lecture Notes in Computer Science. Vol. 2500. Springer. pp. 207–230. doi:10.1007/3-540-36387-4_12. ISBN 978-3-540-00388-5.
Furst, Merrick; Saxe, James B.; Sipser, Michael (1984). "Parity, circuits, and the polynomial-time hierarchy". Mathematical Systems Theory. 17 (1): 13–27. doi:10.1007/BF01744431. MR 0738749. S2CID 14677270.
Honkala, Juha (1989). "A necessary condition for the rationality of the zeta function of a regular language". Theor. Comput. Sci. 66 (3): 341–347. doi:10.1016/0304-3975(89)90159-x. Zbl 0675.68034.
Berstel, Jean; Reutenauer, Christophe (1990). "Zeta functions of formal languages". Trans. Am. Math. Soc. 321 (2): 533–546. doi:10.1090/s0002-9947-1990-0998123-x. Zbl 0797.68092.

ens-cachan.fr (Global: low place; English: low place)

lsv.ens-cachan.fr

Volker Diekert; Paul Gastin (2008). "First-order definable languages" (PDF). In Jörg Flum; Erich Grädel; Thomas Wilke (eds.). Logic and automata: history and perspectives. Amsterdam University Press. ISBN 978-90-5356-576-6.

mit.edu (Global: 476^th place; English: 340^th place)

people.csail.mit.edu

A.R. Meyer & L.J. Stockmeyer (Oct 1972). The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space (PDF). 13th Annual IEEE Symp. on Switching and Automata Theory. pp. 125–129.

esp.mit.edu

L. J. Stockmeyer; A. R. Meyer (1973). "Word Problems Requiring Exponential Time". Proc. 5th ann. symp. on Theory of computing (STOC) (PDF). ACM. pp. 1–9.

rand.org (Global: 3,236^th place; English: 2,152^nd place)

Stephen Cole Kleene (Dec 1951). Representation of Events in Nerve Nets and Finite Automata (PDF) (Research Memorandum). U.S. Air Force / RAND Corporation. Here: p.46

sciencedirect.com (Global: 137^th place; English: 146^th place)

Noam Chomsky (1959). "On Certain Formal Properties of Grammars" (PDF). Information and Control. 2 (2): 137–167. doi:10.1016/S0019-9958(59)90362-6. Here: Definition 8, p.149

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Furst, Merrick; Saxe, James B.; Sipser, Michael (1984). "Parity, circuits, and the polynomial-time hierarchy". Mathematical Systems Theory. 17 (1): 13–27. doi:10.1007/BF01744431. MR 0738749. S2CID 14677270.

springer.com (Global: 182^nd place; English: 172^nd place)

link.springer.com

Weyer, Mark (2002). "Decidability of S1S and S2S". Automata, Logics, and Infinite Games. Lecture Notes in Computer Science. Vol. 2500. Springer. pp. 207–230. doi:10.1007/3-540-36387-4_12. ISBN 978-3-540-00388-5.

stackexchange.com (Global: 4,114^th place; English: 3,027^th place)

cs.stackexchange.com

"How to prove that a language is not regular?". cs.stackexchange.com. Retrieved 10 April 2018.
"Number of words in the regular language $(00)^*$". cs.stackexchange.com. Retrieved 10 April 2018.
"Proof of theorem for arbitrary DFAs".
"Number of words of a given length in a regular language". cs.stackexchange.com. Retrieved 10 April 2018.

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

search.worldcat.org

Hromkovič, Juraj (2004). Theoretical computer science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography. Springer. pp. 76–77. ISBN 3-540-14015-8. OCLC 53007120.

zbmath.org (Global: 2,089^th place; English: 1,141^st place)

3. ⇔ 11. see the proof in the Syntactic monoid article, and see p. 160 in Holcombe, W.M.L. (1982). Algebraic automata theory. Cambridge Studies in Advanced Mathematics. Vol. 1. Cambridge University Press. ISBN 0-521-60492-3. Zbl 0489.68046.
Honkala, Juha (1989). "A necessary condition for the rationality of the zeta function of a regular language". Theor. Comput. Sci. 66 (3): 341–347. doi:10.1016/0304-3975(89)90159-x. Zbl 0675.68034.
Berstel, Jean; Reutenauer, Christophe (1990). "Zeta functions of formal languages". Trans. Am. Math. Soc. 321 (2): 533–546. doi:10.1090/s0002-9947-1990-0998123-x. Zbl 0797.68092.
Straubing, Howard (1994). Finite automata, formal logic, and circuit complexity. Progress in Theoretical Computer Science. Basel: Birkhäuser. p. 8. ISBN 3-7643-3719-2. Zbl 0816.68086.
Sakarovitch, Jacques (2009). Elements of automata theory. Translated from the French by Reuben Thomas. Cambridge: Cambridge University Press. p. 86. ISBN 978-0-521-84425-3. Zbl 1188.68177.

Regular language (English Wikipedia)

ams.org (Global: 434th place; English: 249th place)

mathscinet.ams.org

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

books.google.com (Global: 3rd place; English: 3rd place)

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