https://safernicotine.wiki/mediawiki/index.php?action=history&feed=atom&title=Template%3AStrings 2026-04-19T12:38:59Z Revision history for this page on the wiki MediaWiki 1.44.0 https://safernicotine.wiki/mediawiki/index.php?title=Template:Strings&diff=22849&oldid=prev 2022-01-02T17:28:35Z

<p>1 revision imported</p> <table style="background-color: #fff; color: #202122;" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en-GB"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 18:28, 2 January 2022</td> </tr><tr><td colspan="4" class="diff-notice" lang="en-GB"><div class="mw-diff-empty">(No difference)</div> </td></tr> <!-- diff cache key uk_vapewiki:diff:1.41:old-22848:rev-22849 --> </table>

Richardpruen https://safernicotine.wiki/mediawiki/index.php?title=Template:Strings&diff=22848&oldid=prev 2020-02-04T17:12:58Z

<p>a regular grammar describes a set of strings; regular tree grammars are a generalization that describe sets of trees; what about <a href="/mediawiki/index.php?title=Deterministic_finite_automaton&amp;action=edit&amp;redlink=1" class="new" title="Deterministic finite automaton (page does not exist)">Deterministic finite automaton</a>, <a href="/mediawiki/index.php?title=Regular_language&amp;action=edit&amp;redlink=1" class="new" title="Regular language (page does not exist)">regular language</a>. <a href="/mediawiki/index.php?title=Alternating_finite_automaton&amp;action=edit&amp;redlink=1" class="new" title="Alternating finite automaton (page does not exist)">alternating finite automaton</a>, <a href="/mediawiki/index.php?title=Prefix_grammar&amp;action=edit&amp;redlink=1" class="new" title="Prefix grammar (page does not exist)">prefix grammar</a>?</p> <p><b>New page</b></p><div>{{Navbox<br /> |name = Strings<br /> |title = [[String (computer science)|Strings]]<br /> |state = {{{state|autocollapse}}}<br /> |listclass = hlist<br /> <br /> |group1 = [[String metric]] &lt;!-- There are more diverse metrics in this article --&gt;<br /> |list1 =<br /> * [[Approximate string matching]] &lt;!-- not the best place for this topic --&gt;<br /> *[[Bitap algorithm]] &lt;!-- approximate string matching algorithm --&gt;<br /> * [[Damerau–Levenshtein distance]]<br /> * [[Edit distance]] &lt;!-- also string metric! --&gt;<br /> * [[Gestalt Pattern Matching]]<br /> * [[Hamming distance]]<br /> * [[Jaro–Winkler distance]]<br /> * [[Lee distance]]<br /> * [[Levenshtein automaton]] &lt;!-- really an algorithm for recognizing bounded distance --&gt;<br /> * [[Levenshtein distance]]<br /> * [[Wagner–Fischer algorithm ]] &lt;!-- general algorithm / independent of metric --&gt;<br /> <br /> |group2 = [[String-searching algorithm]] &lt;!-- find location of specific string --&gt;<br /> |list2 = <br /> * [[Apostolico–Giancarlo algorithm]] &lt;!-- Boyer-Moore variant --&gt;<br /> * [[Boyer–Moore string-search algorithm]]<br /> * [[Boyer–Moore–Horspool algorithm]] &lt;!-- Boyer-Moore variant --&gt;<br /> * [[Knuth–Morris–Pratt algorithm]]<br /> * [[Rabin–Karp algorithm]]<br /> <br /> |group3 = Multiple string searching &lt;!-- find location of one of many specific strings --&gt;<br /> |list3 = <br /> * [[Aho–Corasick algorithm|Aho–Corasick]]<br /> * [[Commentz-Walter algorithm]]<br /> <br /> |group4 = [[Regular expression]]<br /> |list4 =<br /> *[[Comparison of regular-expression engines]]<br /> *[[Regular grammar]]<br /> *[[Thompson&#039;s construction]]<br /> *[[Nondeterministic finite automaton]]<br /> <br /> |group5 = [[Sequence alignment]]<br /> |list5 =<br /> *[[Hirschberg&#039;s algorithm]] &lt;!-- sequence alignment --&gt;<br /> *[[Needleman–Wunsch algorithm]] &lt;!-- sequence alignment; similar Wagner-Fischer --&gt;<br /> *[[Smith–Waterman algorithm]] &lt;!-- sequence alignment --&gt;<br /> <br /> |group6 = [[Data structure]]<br /> |list6 =<br /> *[[Deterministic acyclic finite state automaton|DAFSA]]<br /> *[[Suffix array]]<br /> *[[Suffix automaton]]<br /> *[[Suffix tree]]<br /> *[[Generalized suffix tree]]<br /> *[[Rope (data structure)|Rope]]<br /> *[[Ternary search tree]]<br /> *[[Trie]]<br /> <br /> |group7 = Other<br /> |list7 =<br /> *[[Parsing]]<br /> *[[Pattern matching]]<br /> *[[Compressed pattern matching]]<br /> *[[Longest common subsequence problem|Longest common subsequence]]<br /> *[[Longest common substring problem|Longest common substring]]<br /> *[[Sequential pattern mining]] &lt;!-- too far afield? --&gt;<br /> *[[:Category:String sorting algorithms|Sorting]]<br /> <br /> }}&lt;noinclude&gt;<br /> {{Documentation|content=<br /> <br /> {{collapsible option}}<br /> <br /> ==See also==<br /> *{{tl|String instruments}}<br /> *{{tl|String quartets}}<br /> <br /> }}<br /> &lt;/noinclude&gt;</div>

Wikipedia>Jochen Burghardt