Tim BrayMore recreational reading for the world's 17 lovers of wrangling both finite automata and UTF-8. I previously challenged Fedi with the question: How many states does an automaton need to match any Unicode code point? Answer in the next post and explanation in the blog piece.
Matching “.” in UTF-8: https://www.tbray.org/ongoing/When/202x/2024/12/18/Matching-Dot-in-UTF8
All GNU social JP content and data are available under the