MHB Convert a non-deterministic finite automata to a regular expression.

AI Thread Summary
The discussion focuses on converting a non-deterministic finite automaton (NFA) to a regular expression. The original poster expressed uncertainty about their solution, which was a*ab(baUb)*b, and sought clarification on their conversion process. They acknowledged a mistake in their diagram and described the preprocessing steps required for the NFA, including ensuring a single final state and proper arrow configurations. After sharing their lecture notes on the conversion algorithm, they later confirmed that they successfully solved the problem. The thread highlights the importance of accurate representation and understanding of conversion methods in automata theory.
JamesBwoii
Messages
71
Reaction score
0
Physics news on Phys.org
Hi, and welcome to the forum!

In the first image, you have an arrow labeled just be $b$ from the second state to the accepting state, but in the first automata in the second image, this arrow is labeled by $a,b$.

Also, which book or source describes the conversion procedure you are using?
 
Sorry, the first image is the correct one and the one I have drawn at the top of the page is a mistake.

As for the procedure it is a method that has been taught to us in lectures, although I could be misunderstanding it, here is how I take it:

Firstly, the NFA must be preprocessed such that:
1. Has a single final state.
2. Initial state does not have any incoming arrows.
3. Final state has no out going arrows.

As for the conversion algorithm, I will post a photo of my lecture notes as I feel that will represent it best - http://i.imgur.com/kbbVD1w.png

EDIT: I've managed to solve it now.
 
Last edited:
Back
Top