Regular expressions are a sequence of characters used to match patterns in text. They were first formalized by Stephen Cole Kleene in the 1950s and have since been used in search engines, word processors, text editors, and programming languages. Different syntaxes exist for writing regular expressions, such as POSIX and Perl.
Carnegie Mellon University
Spring 2015
A foundational course that introduces formal languages, automata, computability, and complexity theories, including finite automata, Turing machines, and P/NP classes.
No concepts data
+ 35 more conceptsStanford University
Winter 2023
This course is centered on extracting information from unstructured data in language and social networks using machine learning tools. It covers techniques like sentiment analysis, chatbot development, and social network analysis.
No concepts data
+ 14 more conceptsUC Berkeley
Fall 2022
Explores how compilers translate high-level languages into machine-understandable code, offering practical experience with developing compilers for various languages. Also covers reasoning about compiler correctness and understanding runtime errors.
No concepts data
+ 28 more conceptsStanford University
Winter 2023
CS 103 introduces mathematical logic, proofs, and discrete structures, paving the way to an understanding of computational problem-solving. It encourages a profound appreciation of mathematical beauty while addressing concepts like finite automata and regular expressions. CS106B is a prerequisite or corequisite. The course also incorporates programming assignments.
No concepts data
+ 10 more concepts