String Matching Automaton

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

Matching of strings can be done by automata. The random string at the top is processed by the automaton shown in the graph. It implements recognition of the pattern to match. The automaton processes each input character once. Beginning and ending positions of matches are indicated at the bottom.

Contributed by: Michael Schreiber (March 2011)
Open content licensed under CC BY-NC-SA




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.