2010 **Abstract:** Abstract. Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiveness of the automata models are considered modulo language equivalence. This notion of equivalence is arguably too coarse to satisfactorily deal with a notion of interaction that is fundamental to contemporary computing. In this paper we therefore reconsider the automaton models from automata theory modulo branching bisimil…

Help me understand this report

Search citation statements

Paper Sections

Select...

2

1

1

1

Citation Types

0

12

0

Year Published

2011

2013

Publication Types

Select...

1

1

Relationship

0

2

Authors

Journals

(12 citation statements)

(11 reference statements)

0

12

0

“…the set of states S p consists of all process expressions reachable from p; 2. the transition relation → p is the restriction to S p of the transition relation → defined on all process expressions by the operational rules in Table 1 3. the process expression p is the initial state, i.e.…”

confidence: 99%

“…the set of states S p consists of all process expressions reachable from p; 2. the transition relation → p is the restriction to S p of the transition relation → defined on all process expressions by the operational rules in Table 1 3. the process expression p is the initial state, i.e.…”

confidence: 99%

“…If we use action postfix instead of action prefix, then on the one hand not every finite automaton can be specified, and on the other hand, by means of a simple recursive equation we can specify an infinite transition system (see [4]). We conclude that the classes of processes defined by right-linear and left-linear grammars do not coincide.…”

confidence: 99%

“…We note that, from a process-theoretic point of view, the ES and FSES approaches lead to the same notion of pushdown process, whereas the FS approach leads to a different notion. We established in [4] that for FS, the connection with context-free grammars is more difficult to make (see further on). That is why we adopt the FSES approach in the sequel.…”

confidence: 99%