public static void NonMinimalDfa()
{
//
// Non-minimal DFA (Exercise 4.4.1 in the book)
//
var nonMinDfa = new Dfa <string>('A', new [] { 'D' });
nonMinDfa.AddTrans('A', "0", 'B');
nonMinDfa.AddTrans('A', "1", 'A');
nonMinDfa.AddTrans('B', "0", 'A');
nonMinDfa.AddTrans('B', "1", 'C');
nonMinDfa.AddTrans('C', "0", 'D');
nonMinDfa.AddTrans('C', "1", 'B');
nonMinDfa.AddTrans('D', "0", 'D');
nonMinDfa.AddTrans('D', "1", 'A');
nonMinDfa.AddTrans('E', "0", 'D');
nonMinDfa.AddTrans('E', "1", 'F');
nonMinDfa.AddTrans('F', "0", 'G');
nonMinDfa.AddTrans('F', "1", 'E');
nonMinDfa.AddTrans('G', "0", 'F');
nonMinDfa.AddTrans('G', "1", 'G');
nonMinDfa.AddTrans('H', "0", 'G');
nonMinDfa.AddTrans('H', "1", 'D');
SaveFile("dfaNonMin.dot", DotLanguagePrinter.ToDotLanguage(nonMinDfa));
Console.WriteLine($"Eq state pairs: {nonMinDfa.DisplayEquivalentPairs()}");
Console.WriteLine($"Eq state sets: {nonMinDfa.DisplayMergedEqSets()}");
var minDfa = nonMinDfa.ToMinimumDfa();
SaveFile("dfaMin.dot", DotLanguagePrinter.ToDotLanguage(minDfa));
}
public static void EquivalenceOfTwoDfas()
{
//
// Equivalence of two DFAs (Example 4.21 in book)
//
var eqDfas = new Dfa <string>('A', new [] { 'A', 'C', 'D' }); // start state is redundant for finding equivalent blocks
// First DFA
eqDfas.AddTrans('A', "0", 'A');
eqDfas.AddTrans('A', "1", 'B');
eqDfas.AddTrans('B', "0", 'A');
eqDfas.AddTrans('B', "1", 'B');
// Second DFA
eqDfas.AddTrans('C', "0", 'D');
eqDfas.AddTrans('C', "1", 'E');
eqDfas.AddTrans('D', "0", 'D');
eqDfas.AddTrans('D', "1", 'E');
eqDfas.AddTrans('E', "0", 'C');
eqDfas.AddTrans('E', "1", 'E');
SaveFile("dfa_eq.dot", DotLanguagePrinter.ToDotLanguage(eqDfas));
//System.Console.WriteLine();
Console.WriteLine($"Eq state pairs: {eqDfas.DisplayEquivalentPairs()}");
Console.WriteLine($"Eq state sets: {eqDfas.DisplayMergedEqSets()}");
}
