Module04 - 1 Module 4: Formal Definition of Solvability...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1 Module 4: Formal Definition of Solvability Analysis of decision problems Two types of inputs:yes inputs and no inputs Language recognition problem Analysis of programs which solve decision problems Four types of inputs: yes, no, crash, loop inputs Solving and not solving decision problems Classifying Decision Problems Formal definition of solvable and unsolvable decision problems 2 Analyzing Decision Problems Can be defined by two sets 3 Decision Problems and Sets Decision problems consist of 3 sets The set of legal input instances (or universe of input instances) The set of yes input instances The set of no input instances Yes Inputs No Inputs Set of All Legal Inputs 4 Redundancy * Only two of these sets are needed; the third is redundant Given The set of legal input instances (or universe of input instances) This is given by the description of a typical input instance The set of yes input instances This is given by the yes/no question We can compute The set of no input instances 5 Typical Input Universes *: The set of all finite length strings over finite alphabet Examples {a}*: {/\, a, aa, aaa, aaaa, aaaaa, } {a,b}*: {/\, a, b, aa, ab, ba, bb, aaa, aab, aba, abb, } {0,1}*: {/\, 0, 1, 00, 01, 10, 11, 000, 001, 010, 011, } The set of all integers If the input universe is understood, a decision problem can be specified by just giving the set of yes input instances 6 Language Recognition Problem Input Universe * for some finite alphabet Yes input instances Some set L subset of * No input instances * - L When is understood, a language recognition problem can be specified by just stating what L is. 7 Language Recognition Problem * Traditional Formulation Input A string x over some finite alphabet...
View Full Document

Page1 / 26

Module04 - 1 Module 4: Formal Definition of Solvability...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online