29 lines
920 B
Markdown
29 lines
920 B
Markdown
---
|
|
title: "The Humble Finite State Machine"
|
|
|
|
description: "Finite state machines are somewhat underrated"
|
|
|
|
date: "2026-05-01"
|
|
|
|
draft: true
|
|
|
|
tags: []
|
|
---
|
|
|
|
Finite state machines (really finite state transducers or mealy machines) are very useful for the simple reason that they are a good model for the mechanism(s) you use to process a log of events to achieve some outcome.
|
|
|
|
# Prior Writing
|
|
|
|
Reading that title I expect roughly one of three responses.
|
|
|
|
1. What's a Finite State machine
|
|
2. Oh a post about something we talked about in the class that brought up Turing Machines in university, aren't these equivalent to Regex?
|
|
3. Finite state machines are neat for (insert use case) I wonder what this guy has to say about them
|
|
|
|
The third group maybe being subdivided between people whose use case seems niche and whose use case is clearly not niche.
|
|
|
|
## What are Finite state machines
|
|
|
|
## Why I consider them useful
|
|
|
|
##
|