Module25 - Module 25 Decision problems about regular...

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

View Full Document Right Arrow Icon
1 Module 25 Decision problems about regular languages Basic problems are solvable halting, accepting, and emptiness problems Solvability of other problems answer-preserving input transformations to basic problems
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 Programs In this unit, our programs are the following three types of objects FSA’s NFA’s regular expressions Previously, they were C++ programs Review those topics after mastering today’s examples
Background image of page 2
3 Basic Decision Problems (and algorithms for solving them)
Background image of page 3

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

View Full DocumentRight Arrow Icon
4 Halting Problem Input FSA M Input string x to M Question Does M halt on x? Give an algorithm for solving the FSA halting problem.
Background image of page 4
5 Accepting Problem Input FSA M Input string x to M Question Is x in L(M)? Give an algorithm ACCEPT for solving the accepting problem.
Background image of page 5

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

View Full DocumentRight Arrow Icon
Empty Language Problem Input FSA M Question Is L(M)={}? Give an algorithm for solving the empty language
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 07/25/2008 for the course CSE 460 taught by Professor Torng during the Fall '07 term at Michigan State University.

Page1 / 16

Module25 - Module 25 Decision problems about regular...

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

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