Saturday, March 5, 2022

Question types in Theory of Computation

 Define a Regular Expression for given DFA.

Define a DFA for the given Regular Expression.

Give the language for the given Regular Expression.

Give the Regular Expression for the given Language.


Construct a DFA for given language.

Construct a PDA for given language.

Construct a TM for given language.



Give a CFG for the given language.

Give the language generated by the given CFG.

Show that given CFG is ambiguous.



at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

How can I run a C++ program directly from Windows?

How-can-I-run-a-C-program-directly-from-Windows

  • IT Full Forms
    Acronym Full Form AJAX Asynchronous JavaScript and XML API Application Programming Interface APK Android Application Package ASP Activ...
  • C program : To check whether M is an exact multiple of N
    #include<stdio.h> int main() {      int M,N,q;   scanf("%i %i",&M, &N);   if((M%N)!=0)   {printf("0&quo...
  • Interview Tips
    "A good company understands that problem solving ability and the ability to learn new things are far more important than knowledge o...