February 2nd, 2010 () architecture, theoretical computer science › admin › No Comments
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 with a time T so that the output depends only on input signals applied over the [...]
July 2nd, 2009 () specification › admin › No Comments
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 and engineers. But perhaps the key reason is that traditional state machine presentations in [...]
May 18th, 2008 () operating systems, software engineering › admin › No Comments
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.