DFA and PDA Programming Implementation - Using C# with MS Visual Studio 2008

Deterministic Finitie Automata Implementation:
A program that can read a DFA from a text file, and support the usual functionalities of a DFA (for the ease of programming i took initial state q0 as I, set of input Σ as S and define transitions using T instead of δ). Implemented a DFA with the 5-tuple (Q, S, T, I, F) and the DFA in a textfile looks like :
Q = {p, q, r, s}// Set of all states.
S= {a, b}// Set of input.
I = p // Initial State.
F = s // Final/acceptable state(s).
T(p, a)= q
T(p, b)= p
T(q, a)= r
T(q, b)= p
T(r, a)= s
T(r, b)= r
T(s, a)= s
T(s, b)= r

Download:
Filename: DFA Implementation C#.rar
FileSize: 256.72 KB
Package Contains: DFAProblem(Task), SampleInput file and Projectfile(VS 2008)

Mirror 1:              Click to Download    

PushDownAutomata Implementation:
A program that can read a simple form of PDA without lambda transition from the console or from a file or as a string within the program, and then support the usual functionalities of a PDA (for the ease of programming i took initial state q0 as I, set of input Σ as S, "stack symbols" as R, "lambda" as e and define transitions using T instead of δ). Implemented a PDA with the 7-tuple (Q, S, R, T, I, F) and the PDA in a text-file looks like :
Q = {p, q, r}
S= {a, b, c}
R= {a, b, $} //Set of stack symbols
I = p
F = s
T (p, a, e)= (p,a)
T (p, b, e)= (p,b)
T (p, c, e)= (q, e)
T (q, a, a)= (q, e)
T (q, b, b)= (q, e)
T (q, c, $)= (r, $)

Download:
Filename: PDA Implementation C#.rar
FileSize: 256.92 KB
Package Contains: PDAProblem(Task), SampleInput file and Projectfile(VS 2008)

Mirror 1:              Click to Download