String matching based on finite automaton: Difference between revisions

From Algowiki
Jump to navigation Jump to search
No edit summary
No edit summary
Line 1: Line 1:
<div class="plainlinks" style="float:right;margin:0 0 5px 5px; border:1px solid #AAAAAA; width:auto; padding:1em; margin: 0px 0px 1em 1em;">
__NOTOC__
<div style="font-size: 1.8em;font-weight:bold;text-align: center;margin:0.2em 0 1em 0">String matching<br>based on finite<br>automaton</div>
[[Category:Algorithm]]
[[Category:Main Algorithm]]
'''Algorithmic problem:''' [[One-dimensional string matching]]


<div style="font-size: 1.2em; margin:.5em 0 1em 0; text-align:center">whatever</div>
'''Type of algorithm:'''


<div style="font-size: 1.2em; margin:.5em 0 .5em 0;text-align:center">[[File:olw_logo1.png|20px]][https://openlearnware.tu-darmstadt.de/#!/resource/string-matching-based-on-finite-automaton-1951 Openlearnware]</div>
'''Auxiliary data:'''
</div>
 
==Abstract view==
 
==Induction basis==
 
==Induction step==
 
==Complexity==
 
==Further information==

Revision as of 13:04, 1 October 2014

Algorithmic problem: One-dimensional string matching

Type of algorithm:

Auxiliary data:

Abstract view

Induction basis

Induction step

Complexity

Further information

Retrieved from "https://wiki.algo.informatik.tu-darmstadt.de/index.php?title=String_matching_based_on_finite_automaton&oldid=537"