CsitLabs
Ctrlk
  • CSIT Labs
  • 1st Semester
  • 2nd Semester
  • 3rd Semester
  • 4th Semester
    • Artificial Intelligence
    • Computer Networks
    • DBMS Lab
    • Operating System
    • Theory of Computation
      • Lab 1 (DFA)
      • Lab 2 (NFA)
  • 5th Semester
  • 6th Semester
  • 7th Semester
  • docs
Powered by GitBook
On this page

Was this helpful?

  1. 4th Semester
  2. Theory of Computation

Lab 1 (DFA)

  • DFA for the language of string over {0.1} in which each string end with 11 ends with 11

  • DFA accepting the string over {a,b} such that each string does not end with ab doesnot end with ab

  • DFA for the language of string over {a,b} such that each string contain aba as substring contains aba as substring

  • DFA for the langague of string over {0,1} such that each string start with 01 starts with 01

  • DFA for the langague of string over {0,1} such that set of all string ending in 00 ends with 00

  • DFA for the langague of string over {0,1} such that set of strings with 011 as a substring contains 011 as substring

PreviousTheory of ComputationNextLab 2 (NFA)

Last updated 1 year ago

Was this helpful?