Skip to content

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 & Brzozowski Algorithm
Regular expressions are an algebraic notation to describe regular languages. They can be converted into minimal deterministic finite automata with the elegant Brzozowski algorithm.
On , 29 words
Weighted Automata
Automata can be generalized by adding weights to transitions. This way they can compute more complicated functions than just predicates.
On , 22 words
An Introduction to Automata
Why are automata so interesting? Automata are so simple that they fit in many places and situations.
On , 21 words