FA-Lambda

On the bottom page page 170 (Chapter 9, Cohen) the last sentence reads "All the TGs in this proof could be replaced with FA-Lambda's that could then be converted into FAs by the algorithm of Theorem 7."

I use Lambda to replace the equivalent Greek letter/symbol used in Cohen.

Does anyone know if FA-Lambda means NFA? Perhaps it was mentioned earlier in the text and I missed it.

I would be grateful for any comments by fellow students or lecturers.

Best wishes from a rainy England!

rleeman Wrote:
-------------------------------------------------------
> On the bottom page page 170 (Chapter 9, Cohen) the
> last sentence reads "All the TGs in this proof
> could be replaced with FA-Lambda's that could then
> be converted into FAs by the algorithm of Theorem
> 7."
>
> I use Lambda to replace the equivalent Greek
> letter/symbol used in Cohen.
>
> Does anyone know if FA-Lambda means NFA? Perhaps
> it was mentioned earlier in the text and I missed
> it.
>
> I would be grateful for any comments by fellow
> students or lecturers.
>
> Best wishes from a rainy England!


NFA means Non-Finite Automata .. well if i can remember correctly ?!

I know what NFA is. My question is what is FA-Lambda (bottom page 170) and does Cohen mean the same thing by it as NFA?

Yes, FA-lamda is actually a FA with lamda edges i.e. an NFA.

Thank you.

* NFA = Non deterministic FA
* FA-Lambda looks like NFA-Lambda which according to page 164 is an NFA with empty words as edges OR it might be an FA that accepts empty word edges (as well as all other letters )