… process graphs shows that our bisimulation equivalence … equivalence" or "strong equivalence"
of CFG's (see [Sa 2], p.287), an equivalence notion which also happens to be decidable. (…

… equivalence. The proof is given by displaying a periodic structure of the process graphs …
of the solvability of the equivalence problem for simple context-free languages is given. …

… decidable for finite-state processes, it is undecidable when one moves beyond finite automata
to context-free languages… transition graph generated from normed contextfree processes. …

… , it is undecidable when one moves beyond finite automata to context-free languages. For
… on showing that there is a .finite self-bisimulation relation which generates the bisimulation …

… equivalence. The proof is given by displaying a periodic structure of the process graphs …
of the solvability of the equivalence problem for simple context-free languages is given. …

… The Chomsky hierarchy of languages can be generated using grammars or using automata.
… Both accept the same languages, the context-free languages. A slight shift in focus is very …

… the same family of languages, the context-free languages. … of behaviour (as language
equivalence need not be preserved … process into a normed context-free process which generates …

… to bisimilarity pushdown automata are richer than contextfree … in concurrency theory (tableaux
methods) we have simplified … whether bisimulation equivalence is also decidable for Type …

… , except bisimulation équivalence, none of the other process … [12] is decidable for normed
context-free processes. To obtain a … context-free grammar is equivalent to a simple grammar. (…

… In the theory of formal languages one generally associates a context-free grammar with a …
of the decidability of bisimulation equivalence for concurrent context-free processes uses a …