Free

COMPUTABILITY - Essay Example

Comments (0) Cite this document
Summary
Download full paperFile format: .doc, available for editing
GRAB THE BEST PAPER93.9% of users find it useful
COMPUTABILITY
Read TextPreview

Extract of sample "COMPUTABILITY"

1. Consider the language given by the regular expression a*bc*. (a) Give a JFLAP implementation of a DFA that recognises this language, and test it on a suitable set of test data. (You need not include screen shots for each test screen, just give the trace of the DFAs behaviour on each.) (4 marks)
(b) Give a Type 3 grammar for this language and show how it produces those strings in your test data, which are accepted by your DFA. (4 marks)
S => => aA
=> bB
=> bC
=> b
A => bB
=> bC
=> b
B => aA
=> bB
=> bC
C => b
=> aA
=> bB
=> cC
=> b
2. Consider the language {anbcn|n>=1}.
(a) State the pumping lemma for regular languages and use it to show that this language is not regular. (4 marks)
Assume L={anbcn|n>=1} is a regular language. Then pumping lemma holds.
Let p be the pumping length for L given by the lemma.
We choose S=apbcp {in L of length >= p}
Consider all cases s can be divided into x,y,z such that s=xyz satisfying conditions of the pumping lemma |y| > 0 and |xy| s= abic for all i >=0, lets take i=0
s= ab0c ==> s= ac
Therefore, L is not a regular language because s= ac does not satisfy the pumping lemma.
(b) Show that this language is context free by giving a CFG for this language. (3 marks)
L = {anbcn|n>=1}
CFG = {V,{a,b,c},P,S}
P:
S => abc
S => aSc


The lemma does not satisfy the language as a context-free grammar.
3. Consider the language {anb2ncn}.
(a) State the pumping lemma for context free languages and use it to show that this language is not context free. (7 marks)
L= {anb2nc}
CFG = { V, {a,b,c}, P, S }
P:
S => abbc
S => aSbbc
S => aSbc
The lemma does not satisfy the language as a context-free grammar.
(b) Give a JFLAP implementation of a Turing Machine that decides this language, and test it on a suitable set of test data. Read More
Cite this document
  • APA
  • MLA
  • CHICAGO
(“COMPUTABILITY Essay Example | Topics and Well Written Essays - 500 words”, n.d.)
COMPUTABILITY Essay Example | Topics and Well Written Essays - 500 words. Retrieved from https://studentshare.org/miscellaneous/1527777-computability
(COMPUTABILITY Essay Example | Topics and Well Written Essays - 500 Words)
COMPUTABILITY Essay Example | Topics and Well Written Essays - 500 Words. https://studentshare.org/miscellaneous/1527777-computability.
“COMPUTABILITY Essay Example | Topics and Well Written Essays - 500 Words”, n.d. https://studentshare.org/miscellaneous/1527777-computability.
  • Cited: 0 times
Comments (0)
Click to create a comment or rate a document

CHECK THESE SAMPLES OF COMPUTABILITY

Guidelines Assessment

...-Vaisey, 1997), although this has been found to be difficult in many cases (Cabana et al., 1999; Michie & Lester, 2005). Clinical practice guidelines can involve computer algorithms, and their formulation can be heavily reliant on information technology (Field et al., 1990). The purpose of the AGREE instrument is to stress that the usefulness of these clinical practice guidelines is proportional to the quality of the guidelines themselves. This means that the AGREE instrument is primarily concerned with providing a framework with which to assess these guidelines, and states that it will: Assess the quality of guidelines; Provide a methodological strategy for the development of guidelines; and Inform what information and...
6 Pages(1500 words)Research Paper

Clinical guidelines assessment

...domains whereas for evaluation the GLIA several dimensions are used that include: Decidability, Executability, Effect On Process Of Care, Presentation & Formatting, Measurable Outcomes, Apparent Validity, Novelty/Innovation, Flexibility, And Computability thus their use can also be determined by the aspect one what to assess (Shiffman, Dixon, Brandt, & et al, 2005). In essence the AGREE II instrument is used in evaluating the quality of the clinical practices guidelines while the GLIA is used evaluate the Implementability of the clinical practices guidelines i.e. to check for any obstacles to implementation. Guidelines The three recommendations formulated in this paper and their GLIA instruments are based on the evidence...
18 Pages(4500 words)Research Paper

Clinical guidelines assessment

.... On the other hand, GLIA is concerned with the implementation part of the guideline development. It has been noted that some of the guidelines that have been developed are hard to put into practice as compared to others (Kashyap et al, 2011, p.1). GLIA is used to assess the Implementability of the guidelines that have been developed. GLIA considers various factors related to the implementation like decidability, executability, computability, validity, and measurability among many others. GLIA is also applied in assessing the recommendations and can be used to identify the barriers to the implementation of the guidelines (Shiffman et al, 2005, p.5). From the evidence statement listed below, formulate three recommendations...
6 Pages(1500 words)Research Paper

Event Handling and Web Forms

...‘this’ keyword along with traditional model for cross-browser compatibility. The area where the browser computability is the least is reading out the properties of the event. In this we have to ensure that very detailed object detection is used. The first step should be check if the property exists in the browser and if it does only then should the value be read out (D Flanagan, 2011) The last thing to be decided is the event order. The code –writer has to see if he wants the event to bubble up and if that is not the desired result; the propagation of the event should be stopped. The compatibility between different models is a problem; however if we take in to account the precautions mentioned above a workaround can be...
3 Pages(750 words)Essay

Exploring the relationship between digital Architecture and digital fabrication

...and advantageous link between architecture and fabrication. As a matter of fact, it emerges that the relationship between the two is solely responsible for the increased automation in the construction industry. Table of Contents Abstract 2 Introduction 4 Digital architecture 5 Digital fabrication 6 Digital architecture versus digital fabrication 8 Case study: Greater London Authority 12 Discussion 15 Conclusion 17 Reference 19 Table of figures Figure 1: Paradigmatic shift in digital design 8 Figure 2: levels of digital computability 9 Figure 3: Mercedes Benz Museum 10 Figure 4: Cecil Belmond’s Serpentine Gallery Pavilion 11 Figure 5: Weaire-Phelan structure and Water Cube 12 Figure 6: Greater London Authority 13 Figure...
14 Pages(3500 words)Essay

Computing

... ComputingComputability Theory The field of computer science deals with the idea of computability theory which looks at mathematical and logical problems by examining their solvability. In essence it examines if a problem can be positively handled by a logic machine or not. In even simpler terms, computability theory works at the very limits of computing power so while we can expect computers today to be very powerful and complex machines; there are certain limits to the problems they can solve. In certain situations, computability theory suggests that specialized computers might be...
9 Pages(2250 words)Essay

TURING MACHINE

...TURING MACHINE Table of Contents Table of Contents 2 Introduction 3 Turing machines 3 Universal Turing machine 4 Structure 5 Performance comparison with real machines 6 Deterministic versus nondeterministic Turing machines 8 Recursive function with Turing Machine 8 Solubability and Unsolubability with Turing Machine 9 Problems with Turing Machine 9 Conclusion 10 References 11 Introduction A Turing machine is one kind of computer that is powerful however uncomplicated in structure. In addition, it is helpful in thinking regarding the limits and nature of computation and computability for the reason that its technique of computation is extremely simple as someone can...
6 Pages(1500 words)Essay

Event Handling And Web Forms

...‘this' keyword along with the traditional model for cross-browser compatibility. The area where the browser computability is the least is reading out the properties of the event. In this, we have to ensure that very detailed object detection is used. The first step should be check if the property exists in the browser and if it does only then should the value be read out (D Flanagan, 2011) The last thing to be decided is the event order. The code –writer has to see if he wants the event to bubble up and if that is not the desired result; the propagation of the event should be stopped. The compatibility between different models is a problem; however, if we take in to account the precautions mentioned above a workaround...
3 Pages(750 words)Essay

Questions in Theory of Computation

...Number: THEORY OF COMPUTABILITY a) Describe what is meant by a greedy algorithm. [5 points] This is an algorithm which follows the problem resolving met heuristic of building the locally ideal choice at every stage with the hope of finding the global optimum. They are ideal simply for hitches with optimal substructure. Despite this, greedy algorithms are suited for easy problems and may be used as a selection algorithm to highlight options in a search. Its variation includes pure greedy, orthogonal greedy and the relaxed greedy (b). Describe what is meant by a divide-and-conquer algorithm. [5 points] This is a top to down system used to design an algorithm which involves dividing the problem into sub problems so that...
3 Pages(750 words)Assignment

Ackermann's Function

...Ackermann’s Function Ackermann’s Function OverviewAs far as the computability theory is concerned, Ackermann function can be described as one of the earliest and simplest-discovered forms of the general computable function, which is not a primitive recursive. It is important to realize that often, all the primitive recursive functions happen to be computable and total. However, the Ackermann’s function has often effectively illustrated that all the total computable function are not primitive recursive (Memon 2014); this function was developed by Wilhelm Ackermann, who is one of the renowned mathematicians, whose influence continues to be experienced in modern times. How the algorithm works After Ackermann made a publication of his... decimal...
2 Pages(500 words)Research Paper
sponsored ads
We use cookies to create the best experience for you. Keep on browsing if you are OK with that, or find out how to manage cookies.

Let us find you another Essay on topic COMPUTABILITY for FREE!

Contact Us