Construct the minimum state dfa equivalent to given dfa

Assignment Help Theory of Computation
Reference no: EM133655156

Question 1 Construct the minimum state DFA equivalent to given DFA.


0 1
q0 q1 q0
q1 q0 q2
q2 q3 q1
q3 q3 q0
q4 q3 q5
q5 q6 q4
q6 q5 q6
q7 q6 q3

Q.1 Design Mealy machine:

If input ends with 100 output x

If input ends with 110 output y

Otherwise o/p z.

Question 2 Explain in detail closure properties of Regular languages.

Q.2 Design FA for following Regular Expression:

a) 10 (0 + 10)* + 1 (1 + 10)* b) 0*1 (0 + 11) + 10

Question 3 What is ambiguous grammar? Find out following CFG is ambiguos

S → aS|∈
S → aS bS

Q.3 a) Find the CFL associated with the CFG given below:
S → aB +bA
A → a|aS|bAA
B → b|bS|aBB

b) Write a grammar for generating string ∑ = (a) containing any number of a's.

Question 4 Construct PDA accepting language consisting of even palindromes string a's and b's.

Q.4 Design PDA for accepting following language

L = {anbn|n≥ 1)

Question 5 What is Turing machine? Design Turing machine for 2's complement of given binary number 01010101.

Q.5 Construct Turing machine for checking well formedness of parenthesis.

Question 6 Explain the applications of CFG in syntax analyzer phase of compiler with suitable example.

Reference no: EM133655156

Questions Cloud

Examine different periods of policing : Examine different periods of policing and discuss their main strengths and weaknesses.
Continued commitment and shared pursuit of change : You mentioned that a truly inclusive and equitable future of policing can only be achieved through continued commitment and a shared pursuit of change.
Provide an overview of the strengths of each channel choice : Provide an overview of the strengths and weaknesses of each channel choice. Support each channel choice with observations from the company profile.
Where have you found unpublished or grey evidence : Where have you found unpublished or grey evidence? In what way have you used this type of evidence?
Construct the minimum state dfa equivalent to given dfa : Explain in detail closure properties of Regular languages and Construct the minimum state DFA equivalent to given DFA
What level of output manager of redstone choose to produce : What level of output should the manager of Redstone choose to produce? Explain your choice in at least 100 words. Should the firm shut down in the short-run?
Evaluate the pattern of vehicle burglaries in community : A university professor initiates a research project designed to evaluate the pattern of vehicle burglaries in a community.
Capture accurate data involving juvenile delinquency : Pretend you are a researcher trying to determine the best way to capture accurate data involving juvenile delinquency
Prosecutors spend most of their time working directly : Prosecutors spend most of their time working directly with other members of the courtroom work group.

Reviews

Write a Review

Theory of Computation Questions & Answers

  Finite-state machine design

Create a finite-state machine design to turn your FPGA development board into a simple programmable music box.

  Redundant sequence identi cation

Redundant sequence identi cation

  Compute a shortest superstring

Dynamic programming algorithm to compute a shortest superstring.

  Propositional and predicate logic

Write down a structural induction principle for the PlayTree free type

  Design a syntactic analyzer

Design a syntactic analyzer for the language specified by the grammar

  Design unambiguous grammar to parse expressions

Write a program would read two numbers and then print all numbers between the first and the second, inclusive. Design unambiguous grammar to parse expressions

  Consider a logic function with three outputs

Consider a logic function with three outputs,  A ,  B , and  C , and three inputs,  D ,  E , and  F . The function is defined as follows:  A  is true if at least one input is true,  B  is true

  Considering a single programmed operating system

Considering a single programmed operating system, what is the minimal total time required to complete executions of the two processes? You should explain your answer with a diagram.

  How to construct an nfa

Give a construction that assumes you are given a DFA for L and show how to construct an NFA (with or without ε-moves) to recognize sort(L).

  Equivalence classes to construct minimal dfa for language

How many equivalence classes does this relation have and what are they? Use these equivalence classes to construct the minimal DFA for the language.

  Impact of moore-s law on data center costs

Discuss the impact of Moore's law on data center costs on such things as servers and communications equipment. List at least 3 steps or recommendations your data center can take to offset some or all of the effect of Moore's law.

  Problem encountered in statements in predicate logic

How the problem would be encountered in attempting to represent the following statements in Predicate logic. it should be possible to: John only likes to see French movies.

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd