-
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
Category Archives: theoretical computer science
Process algebra reconsidered
Paper is here. The following incorrect claim is not unusual in the process algebra literature. Basically, what is missing [in classical automata theory] is the notion of interaction: during the execution from initial state to fi nal state, a system may … Continue reading
Posted in specification, theoretical computer science
Tagged automata, milner, non-determinism, process algebra
Leave a comment
limits of state diagrams
Here’s a graph of a simple state machine of somewhat under 512 states that models a dumb fifo queue. The initial state is “e” for empty. We can append 1,2 or 3 to this queue and can delete the first … Continue reading