transition graph that accepts only Λ and language a*

Question

I am trying to have a transition graph that accepts only Λ and also one that accepts language a* ...is this ok ???

transition graph that accepts only Λ

transition graph that accepts language a*

Answer 1

The automata you have drawn are correct, but they are redundant.

I would suggest, for a language that accepts only the empty string, a single state which is initial and accepting is enough. No other states or edges needed.

For the language that accespts $a^*$, you draw a state which is initial and accepting and you also need a looping edge for $a$.