News for hackers. Stuff that matters.
Re:Monoid machines: a O(log n) parser for regular languages ... by abecedarius on Thursday July 12, 2018 @08:39PM (#17519742)
Yes, that matches my memory from Hillis's book based on his thesis (iirc it came out a few years before that paper).

I imagine you could also do this for NFAs -- composing them is just a little extra work.

Re:Monoid machines: a O(log n) parser for regular languages ... by pkhuong on Thursday July 12, 2018 @09:08PM (#17519841)
Yes, you can do the same thing with set of states. In either case, https://en.wikipedia.org/wiki/Method_of_Four_Russians might be more practical.