-
Recent
- The UNIX file system as a recursive function
- Apple’s A5 chip made in Austin
- Richard Stallman speaks
- Dennis Ritchie
- Droning on about computer security
- The multics file system
- Fukushima Robot Blog
- Sinking in too many layers
- Computer architecture, power, and PHP
- VCs bailing on signed term sheets
- American corporate management
- Apple’s Patents possibly covering android
- Computer Science 101
- Why computers are more and more devices for generating heat from electricity
- Dutch masters
Tag Archives: state machines
More computer science as humbug [updated with Brazil dream sequence]
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 … Continue reading
sequential and combinational state machines
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 … Continue reading
Recursion and state
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 … Continue reading
Posted in specification
Tagged automata, formal methods, moore machines, state machines
Leave a comment