Wolfram Research

Mathematica MathWorld Wolfram Science More »

String Matching Automaton


	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
	Show Initialization Code

Finite Automata (NKS|Online)

"String Matching Automaton" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/StringMatchingAutomaton/

Contributed by: Michael Schreiber

Report an issue »

Interact with Demonstrations using the latest version of the free Mathematica Player—Download Now

Related Topics

Browse all topics

Some Related Demonstrations

Share & Bookmark This Demonstration

Contribute

Powered by Wolfram Mathematica

Give us your feedback

	Source page:
	Email	Name (optional)
	Occupation (optional)	Organization (optional)
	I use Mathematica often occasionally never
	Country (optional) Remember me
	Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed. Privacy Policy »

© 2009 Wolfram Demonstrations Project & Contributors

Wolfram Research

Site Index

RSS

Atom

Note: To run this Demonstration you need the free
Mathematica Player or Mathematica 7+