Advertisement
Published in:
2011 | OriginalPaper | Chapter
Finite State Automata and Regular Languages
Authors : Prof. Yunlin Su, Prof. Song Y. Yan
Published in: Principles of Compilers
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
One of the most important functions of a computer is to recognize specified patterns. For example, a text-editing software often needs to replace a string of symbols with another string of symbols, whereas a compiler system must scan the symbols of a program to locate a certain key-word. In fact, the fastest string search algorithm is based on pattern recognition, which is in turn, based on automata theory.