something that i want to claim is that we don’t actually need state machines to be finite at all. in a classical automata world, you would think i am crazy, but we can have an infinite number of states, and it’s fast, practical and also guaranteed to terminate. scrap the “finite” and just call it a “deterministic automaton”. this pulls the rug out from under the feet of a lot of theoretical work in automata theory, and it’s a lot harder to grasp, but it gives us a lot of freedom to do things that are impossible in the classical framework, namely context awareness via lookarounds.
14:22, 4 марта 2026Наука и техника
，这一点在搜狗输入法中也有详细论述
It is designed to be fast, portable, and secure.
Россиянин упал в колодец с кипятком и выжилНа Сахалине мужчина случайно упал в колодец с кипятком и выжил
一场比赛通常会包含三个比赛日1，从当地时间的周五到周日，周五会举办两场练习赛，周六会举办一场练习赛和一场排位赛，周日是正式计分的正赛2。