State complexity of pattern matching in regular languages.
Janusz A. BrzozowskiSylvie DaviesAbhishek MadanPublished in: Theor. Comput. Sci. (2019)
Keyphrases
- pattern matching
- regular expressions
- regular languages
- pattern matching algorithm
- string matching
- context free languages
- finite state machines
- finite automata
- grammatical inference
- computational complexity
- boyer moore
- state space
- decision problems
- worst case
- learning algorithm
- approximate pattern matching
- databases