-
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: automata
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
Queues and algebra
Suppose we have a state machine Q, that implements a common first in first out queue. The input alphabet of Q consists of “Deq” and “Enq x” where “x” ranges over a set of values, say, V. Let’s fix the … Continue reading
Posted in architecture, software engineering, theoretical computer science
Tagged automata, fault tolerance, group, monoid
Leave a comment
simple lemma about pipelines
The connection between group structure and pipeline design seems like it merits a lot more attention than it gets. It’s not too hard to show that in a pipeline like the one to the right, the induced monoid of M1 … Continue reading
Posted in software engineering, theoretical computer science
Tagged automata, monoids
Leave a comment