Luca Marx
automata theory, finite state machines, quantum mechanics, category theory, software development.
- By Luca Marx
- Based in Italy
- First post on
We don’t yet have enough data to display a chart of posts over time.
Most recent posts
Regular expressions are an algebraic notation to describe regular languages. They can be converted into minimal deterministic finite automata with the elegant Brzozowski algorithm.
Automata can be generalized by adding weights to transitions. This way they can compute more complicated functions than just predicates.
Why are automata so interesting? Automata are so simple that they fit in many places and situations.