CsitLabs
Search...
Ctrl
K
4th Semester
Theory of Computation
Lab 1 (DFA)
Previous
Theory of Computation
Next
Lab 2 (NFA)
Last updated
8 months ago
Was this helpful?
DFA for the language of string over {0.1} in which each string end with 11
DFA accepting the string over {a,b} such that each string does not end with ab
DFA for the language of string over {a,b} such that each string contain aba as substring
DFA for the langague of string over {0,1} such that each string start with 01
DFA for the langague of string over {0,1} such that set of all string ending in 00
DFA for the langague of string over {0,1} such that set of strings with 011 as a substring