Summary
Finite automata are fundamental objects in Computer Science, of great importance on one hand for theoretical aspects (formal language theory, decidability, complexity) and on the other for practical applications (parsing). In Mathematics, and especially in number theory...
More information & hyperlinks
| Web resources: | https://sites.google.com/site/ercantunivlyon1/home |
