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.



No comments:

Post a Comment

Basic Flask web app

 from flask import Flask app = Flask(__name__) #In Flask, URL rules can be added using either the @app.route() decorator or the app.add_url_...