Rabin-Scott Finite Automata and Their Decision Problems

Download.
Continuing my experiments in academic papers, I sent a paper on automata and circuit verification to CAV2010 (here’s an updated version with some corrections and better references). I actually got one carefully written and well informed review. Sending a paper
There’s a correspondence between the notions of “combinational” and “sequential” in digital circuit engineering and some structure in state machines (and therefore monoids) that seems interesting. In digital logic, a “combinational” circuit like a logic gate has can be associated
Despite some deep results, algebraic automata theory has fallen out of favor in theoretical computer science. Reasons include the disciplines failings such as a love of over-generality, weak mathematical background of people working on “formal methods”, and gap between theoreticians
Please see a new version here. I am continuing to try to develop a practical engineering mathematics for operating system and other complex system code.