fa-decidable

fa-decidable - 8c: Decidable problems of regular languages...

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

View Full Document Right Arrow Icon
8c: Decidable problems of regular languages The following decision problems are decidable (solvable), i.e., there exist algorithms for solving these problems. 1. Given a FA M and a string w ,does M accept w ? 2. Given a regular expression α and a string w ,does α generate w ? 3. Given a FA M ,does M accept e ? 4. Given a FA M ,is L ( M )= ? 5. Given a FA M ,is L ( M )=Σ ? 6. Given two FAs M 1 and M 2 ,is L ( M 1 )= L ( M 2 )? 7. Given two FAs M 1 and M 2 ,is L ( M 1 ) L ( M 2 )? 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
1. Given a FA M and a string w ,does M accept w ? If the FA is nondeterministic, transform it to an equiv- alent DFA. M reads one symbol from w at a time and moves the tape head one position to the right and enters a new state. Since the tape head always moves right and the string is of ±nite length, the algorithm must termi- nate. If M is at a ±nal state when the entire string is read, then M accepts w ; otherwise M does not accept w . Thus, the decision problem is decidable. 2. Given a regular expression
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 5

fa-decidable - 8c: Decidable problems of regular languages...

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

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