Login

Create Account
+14156709189
info@expertsmind.com
Submit Homework/Assignment
Get quote & make Payment
Get Solution
A composablereset DFA (CRDFA) is a fivetuple, Theory of Computation
Question 2 (10 pt): In this question we look at an extension to DFAs. A composablereset DFA (CRDFA) is a fivetuple, (Q,S,d,q0,F) where:
– Q is the set of states,
– S is the alphabet,
– d:Q×(S?{?})?Qisthetransitionfunction, – q0 ? Q is the start state, and
– F ? Q is the set of accept states.
Every CRDFA must satisfy one additional property:
When running a CRDFA one can take a ?transition if and only if the input has already been exhausted, and d cannot have any cycles that have a ?transition.
A CRDFA differs from a DFA by the addition of a new symbol denoted ? which can only be used by the transition function. This symbol is not part of the alphabet of the DFA.
The run function for a CRDFA is defined as follows:
dˆ 0 : Q × S * × S * ? Q dˆ0(q,e,w1) = q
if d(q, ?) is undefined. dˆ0(q, e, w1) = dˆ0(q', w1, w1)
if d(q, ?) = q'
dˆ0(q, aw, w1) = dˆ0(q', w, w1)
if d(q, a) = q' dˆ : Q × S * ? Q
dˆ ( q , w ) = dˆ ( q , w , w ) 0
1
We can see that the run function, dˆ, is defined interms of an auxiliary function called dˆ0. The latter takes three arguments: i. the current state, the input word, and a second input word called w1. The second input word is called an accumulator, and it will be used to remember the original input to the run function, but when defining the auxiliary run function we leave this arbitrary.
The definition of the auxiliary run function follows the definition of the run function for DFAs, but in the case where the input word has been exhausted we check to see if the transition function allows the input to be reset to w1, and if it does, then we call dˆ0 on the next state given by d, and the input word is reset to w1. If when the input is exhausted and the transition function does not allow a ?transition, then we proceed as usual.
Note that the definition of acceptance for a CRDFA is the same as for DFAs.
We now define an interesting language. Suppose S = {a, b, c, d, ?, ?} is an alphabet. The symbol ? represents a binary operation, and the symbols a, b, c, d, and ? represent inputs to the binary operation ?. The language L is defined by the following:
i. a,b,c,d,? ? L
ii. Foranyei ?S,thewordw=e1?e2?e3?···?en ?L
iii. For any w ? L, any wellbalanced parenthesization of w is a member of L
iv. There are no other words in L.
The following are some example words in L:
a
b
c
d
?
(a?b) (a?(b?c)) (a?(b?(c?d))) a?b?c (a?b)?c
So the words of L are all the possible associations of applications of the binary operation ?. Define a CRDFA in the diagrammatic from used with DFAs that recognizes the language L as defined above. In addition, describe why CRDFAs are bad in practice.
Posted Date: 2/2/2015 8:26:13 PM  Location : United States
Ask an Expert
Related Discussions:
A composablereset DFA (CRDFA) is a fivetuple, Assignment Help, Ask Question on A composablereset DFA (CRDFA) is a fivetuple, Get Answer, Expert's Help, A composablereset DFA (CRDFA) is a fivetuple Discussions
Write discussion on A composablereset DFA (CRDFA) is a fivetuple
Your posts are moderated
Write your message here..
Related Questions
Local and recognizable languages, We developed the idea of FSA by generaliz...
We developed the idea of FSA by generalizing LTk transition graphs. Not surprisingly, then, every LTk transition graph is also the transition graph of a FSA (in fact a DFA)the one
Flow charts, https://www.google.com/search?q=The+fomula+n%3D%28x%3D0%29%2F%...
https://www.google.com/search?q=The+fomula+n%3D%28x%3D0%29%2F%281%3D2%29.The+value+x%3D0+and+is+used+to+stop+the+algerithin.The+calculation+is+reapeated+using+values+of+x%3D0+is+in
Answer, And what this money. Invovle who it involves and the fact of,how we...
And what this money. Invovle who it involves and the fact of,how we got itself identified candidate and not withstanding time date location. That shouts me media And answers who''v
Perfect induction, A.(A+C)=A
A.(A+C)=A
A composablereset DFA (CRDFA) is a fivetuple, Question 2 (10 pt): In thi...
Question 2 (10 pt): In this question we look at an extension to DFAs. A composablereset DFA (CRDFA) is a fivetuple, (Q,S,d,q0,F) where: – Q is the set of states, – S is the alph
Mapping reducibility, (c) Can you say that B is decidable? (d) If you someh...
(c) Can you say that B is decidable? (d) If you somehow know that A is decidable, what can you say about B?
Class of recognizable languages, Proof (sketch): Suppose L 1 and L 2 are ...
Proof (sketch): Suppose L 1 and L 2 are recognizable. Then there are DFAs A 1 = (Q,Σ, T 1 , q 0 , F 1 ) and A 2 = (P,Σ, T 2 , p 0 , F 2 ) such that L 1 = L(A 1 ) and L 2 = L(
Llll, mmmm
mmmm
Programming languages, Different types of applications and numerous program...
Different types of applications and numerous programming languages have been developed to make easy the task of writing programs. The assortment of programming languages shows, dif
Discrete math, Find the Regular Grammar for the following Regular Expressio...
Find the Regular Grammar for the following Regular Expression: a(a+b)*(ab*+ba*)b.
Assignment Help
Accounting Assignment Help
Economics Assignment Help
Finance Assignment Help
Statistics Assignment Help
Physics Assignment Help
Chemistry Assignment Help
Math Assignment Help
Biology Assignment Help
English Assignment Help
Management Assignment Help
Engineering Assignment Help
Programming Assignment Help
Computer Science Assignment Help
IT Courses and Help
ExpertsMind Services
Online Tutoring
Projects Assistance
Exam Preparation
Coursework Help
Programming Courses
Engineering Courses
Why Us ?
~Experienced Tutors
~24x7 hrs Support
~Plagiarism Free
~Quality of Work
~Time on Delivery
~Privacy of Work