A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using the rootedâ€¦ (More)

We enhance the notion of a computation of the classical theory of computing with the notion of interaction. In this way, we enhance a Turing machine as a model of computation to a Reactive Turingâ€¦ (More)

J O S C . M . B A E T E N, B A S L U T T I K, T I M M U L L E R, and P A U L V A N T I L B U R G 1 CWI, P.O. Box 94079, NL-1090 GB, The Netherlands Email: Jos.Baeten@cwi.nl 2 Department ofâ€¦ (More)

We enhance the notion of a computation of the classical theory of computing with the notion of interaction from concurrency theory. In this way, we enhance a Turing machine as a model of computationâ€¦ (More)

We investigate the set of basic parallel processes, recursively defined by action prefix, interleaving, 0 and 1. Different from literature, we use the constants 0 and 1 standing for unsuccessful andâ€¦ (More)

We propose reactive Turing machines (RTMs), extending classical Turing machines with a process-theoretical notion of interaction, and use it to define a notion of executable transition system. Weâ€¦ (More)

This survey paper looks into algorithms that deal with massive data sets, streaming data in particular. In addition to reviewing data streaming models and some common problems and applications whereâ€¦ (More)

We consider the expressiveness of reactive Turing machines that extend classical Turing machines with a process-theoretical notion of interaction. We prove that every effective transition system isâ€¦ (More)

We investigate the equational theory of several fragments of CCS modulo (strong) bisimilarity with special attention to restriction and relabelling. The largest fragment we consider includes actionâ€¦ (More)