Grammar Automaton (Computer)
Unrestricted Turing Machines Context Free Pushdown Automata Regular Finite State Automata
+*Create a single, concise regular expression to match a string with 0
or more a’s followed by at least 1 b followed
by at least 1 c. Examples:
abcbcaabbccThese should not match:
acbacTrue if a string matches from the
beginningmatch or searchfindall function can be used for this purpose. are not matched
literally. ^ $ * + ? { } [ ] \ | ( )
[]-” to indicate a range of characters\d - any decimal digit\s - any whitespace\S - any non-whitespace\w - any alphanumericsub can be used to perform regex replacements() can be used to indicate which portion of an
expression to extract{} can be used to specify an exact count on
the preceding character classsearch returns a match object on success0 is always the full match