Talk:Dana Angluin

Latest comment: 7 years ago by InternetArchiveBot in topic External links modified

Editathon warning edit

This page is being edited at an editathon at the Grace Hopper conference on 2012-10-04 EDT (UTC-4). Many new editors may be working on this article LeslieCarr (talk) 21:40, 4 October 2012 (UTC)Reply

Notability edit

Dana Angluin easily satisfies the notability criteria for academics by virtue of a high citation rate (criterion 1). This Google Scholar search shows that she has 12 publications with 200 citations or greater and an h-index of 35. This information cannot be included in the article itself because links to web searches should be avoided. RockMagnetist (talk)

Additional references edit

I add here the references I have about Dana Angluin, leaving it to biographical-wikipedia-article experts to decide which one(s) (if any) to include in the article:

  • D. Angluin (1982). "Inference of Reversible Languages". J.ACM. 293: 741–765.
  • D. Angluin (1981). "A Note on the Number of Queries Needed to Identify Regular Languages". Information and Control. 51: 76–87.
  • D. Angluin (1979). "Finding Patterns Common to a Set of Strings". Proc. 11th Ann. Symp. on Theory of Computing. pp. 130–141.
  • D. Angluin (1978). "On the Complexity of Minimum Inference of Regular Sets". Information and Control. 39 (3): 337–350.
  • Dana Angluin (1974). Easily Inferred Sequences (Technical report). University of California. ERL-M499.

Collaborative works:

  • Thomas Dean, Dana Angluin, Kenneth Basye and Sean Engelson, Leslie Kaelbling, Evangelos Kokkevis and Oded Maron (1995). "Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning". Machine Learning. 18: 81–108.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  • Dana Angluin, William I. Gasarch, Carl H. Smith (1987). Training Sequences (Technical report). University of Maryland. p. 26.{{cite tech report}}: CS1 maint: multiple names: authors list (link)
  • Dana Angluin, William I. Gasarch, Carl H. Smith (1989). "Training Sequences" (PDF). Theoretical Computer Science. 66: 255–272.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  • Dana Angluin, Martinch Krikis (1994). Malicious Membership Queries and Exceptions (Technical report). Yale Univ., Dept. of Comp. Sc. p. 32. YALEU/DCS/TR-1019. {{cite tech report}}: Unknown parameter |month= ignored (help)
  • Dana Angluin; Carl H. Smith (1983). "Inductive Inference: Theory and Methods" (PDF). Computing Surveys. 15 (3): 237–269. {{cite journal}}: Unknown parameter |month= ignored (help)

All entries use the ((cite)) template, which, however, sometimes produces poor output. - Jochen Burghardt (talk) 14:17, 24 November 2013 (UTC)Reply

External links modified edit

Hello fellow Wikipedians,

I have just modified one external link on Dana Angluin. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

When you have finished reviewing my changes, please set the checked parameter below to true or failed to let others know (documentation at {{Sourcecheck}}).

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 18 January 2022).

  • If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
  • If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—InternetArchiveBot (Report bug) 20:37, 5 December 2016 (UTC)Reply