2001-Automata_and_Formal_Languages-scanned-solutions

2001-Automata_and_Formal_Languages-scanned-solutions -...

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

View Full Document Right Arrow Icon
Salutione comprehemive exam Automata aad Formal Languages October 31, 2001 1. Dmw a nondetministie jinite automaton without &-moues (~cceptkg the language (ab)* + e. 3. Consider the following pmblern: Given descriptions of two &ring machines M and N over a given alphabet, is there a Btring accepted by both M and N? Is this problem decidable? No. By Rice's theorem it is undecidable whether a given Turing machine M accepts a non- empty language- That problem can be reduced to the problem above, by taking N to be a fixed Turing machine that accepts every string over the given alphabet. It follows that also the problem above is undecidable. Is it mursiue enumemble? Yes. Given descriptions of M and N, enumerate all pairs (w, n) with w a word over the given alphibet and n a natural number. For each such pair (ul,n) run both M snd N on w for n steps. In case both accept, return "Yesn.
Background image of page 1

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

View Full DocumentRight Arrow Icon
4. A clique of sise k in an undided gmph G is a subgmph math k nodes, wherein every two nodes are connected an edge. In porticulor, them must be an edge behueen
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/18/2011 for the course CS 154 at Stanford.

Page1 / 2

2001-Automata_and_Formal_Languages-scanned-solutions -...

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

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