Automata and Formal Languages: Examples
Note: This is an archvied version of our old webpage. Some links might be broken. The current one can be found here.
Bisimulation
- Two NFAs and their product
nfa1,
nfa2,
product
- Minimization with respect to bisimilarity using the partitioning algorithm.
In each iteration an existing partition is split. Bisimilar states are identified
by the same color. In the end, bisimilar states are merged to obtain the minimal NFA
wrt. bisimilarity:
PDF