3 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.LO2011★ 3 cited
Reactive Turing Machines
Jos C. M. Baeten, Bas Luttik, Paul van Tilburg
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 transi…
cs.LO2010★ 1 cited
Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract)
Jos C. M. Baeten, Bas Luttik, Tim Muller +1
The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described b…