Ogden's lemma (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Ogden's lemma" in English language version.

refsWebsite
Global rank English rank
2nd place
2nd place
5th place
5th place
11th place
8th place
9,437th place
low place

doi.org

doi.org

  • Ogden, William (September 1968). "A helpful result for proving inherent ambiguity". Mathematical Systems Theory. 2 (3): 191–194. doi:10.1007/bf01694004. ISSN 0025-5661. S2CID 13197551.
  • Bader, Christopher; Moura, Arnaldo (April 1982). "A Generalization of Ogden's Lemma". Applied Mathematics and Computation. 29 (2): 404–407. doi:10.1145/322307.322315. S2CID 33988796.
  • Dömösi, Pál; Kudlek, Manfred (1999), "Strong iteration lemmata for regular, linear, context-free, and linear indexed languages", Fundamentals of Computation Theory, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 226–233, doi:10.1007/3-540-48321-7_18, ISBN 978-3-540-66412-3, retrieved 2023-02-26

dx.doi.org

  • Ogden, William (September 1968). "A helpful result for proving inherent ambiguity". Mathematical Systems Theory. 2 (3): 191–194. doi:10.1007/bf01694004. ISSN 0025-5661. S2CID 13197551.
  • Dömösi, Pál; Kudlek, Manfred (1999), "Strong iteration lemmata for regular, linear, context-free, and linear indexed languages", Fundamentals of Computation Theory, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 226–233, doi:10.1007/3-540-48321-7_18, ISBN 978-3-540-66412-3, retrieved 2023-02-26

semanticscholar.org

api.semanticscholar.org

  • Ogden, William (September 1968). "A helpful result for proving inherent ambiguity". Mathematical Systems Theory. 2 (3): 191–194. doi:10.1007/bf01694004. ISSN 0025-5661. S2CID 13197551.
  • Bader, Christopher; Moura, Arnaldo (April 1982). "A Generalization of Ogden's Lemma". Applied Mathematics and Computation. 29 (2): 404–407. doi:10.1145/322307.322315. S2CID 33988796.

uni-bielefeld.de

wwwhomes.uni-bielefeld.de

worldcat.org

  • Ogden, William (September 1968). "A helpful result for proving inherent ambiguity". Mathematical Systems Theory. 2 (3): 191–194. doi:10.1007/bf01694004. ISSN 0025-5661. S2CID 13197551.
  • Hopcroft, John E. (1979). Introduction to automata theory, languages, and computation. Jeffrey D. Ullman. Reading, Mass.: Addison-Wesley. p. 128. ISBN 0-201-02988-X. OCLC 4549363.