Milner’s Communication and Concurrency contrasts a notion of “bisimulation” with what he characterizes as the view in standard automata theory. Standard automata theory, however, has
Read more
Judea Pearl’s mysterious claim
Pearl: Of course, but you cannot see this noble aspiration in scientific equations. The language of algebra is symmetric: If x tells us about y, then y tells us about x. I’m
Read moreProcess algebra is based on a misunderstanding of automata theory
See the current pdf in Arxiv Robin Milner’s book Communication and Concurrency involves a take on state machines that is fundamentally incorrect. “Now in standard
Read morePractical State Machines for Computer Software and Engineering
Download paper. [gview file=”https://www.yodaiken.com/wp-content/uploads/2016/01/practical.pdf”]
Read moreTheories of abstract automata – Arbib
We have said that automata theory deals with the realization of partial functions F: X* —» Y* by some finitely specifiable substrate. Before we specify
Read morethe terrible effect of Krohn-Rhodes
One of the most interesting theorems in computer science is the Krohn-Rhodes theorem that shows a strong link between basic computer science and group theory.
Read moreProcess 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
Read moreQueues 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
Read moresimple 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
Read moreProcess Algebra and classical automata
The long awaited process algebra paper is now finally available in PDF Reducing Process Algebra.
Read more