## Regular Languages and Finite Automata

Language An alphabet $$\Sigma$$ is a finite set of symbols, for example $$\Sigma=\{0,1\}$$. A string is a finite sequence of symbols from $$\Sigma$$. We denote the empty string by $$\epsilon$$. The set of all strings over $$\Sigma$$ is $$\Sigma^\star$$, using

Tagged with: , ,
Posted in Theory

## Regular Expressions in Java

Regular Expression Basics Regular expressions (regex) are an effective way of describing common patterns in strings. For example, all phone numbers in North America have 10 digits; this can be easily described by regular expressions: [0-9]{10}, which matches with 10

Tagged with: ,
Posted in Java