Computer Science help (DFA)

[Pezzoni]

I need to state what the below DFA does; It seems to accept words starting in 0 and ending in 1, and 1 - a technically correct (as far as I can tell) definition, but it doesn't seem like a particularly tidy definition. Am I missing something here?



Any gentle prodding in the correct direction (if I'm not already there) would be appreciated

Thanks,

[Molyneux]

I need to state what the below DFA does; It seems to accept words starting in 0 and ending in 1, and 1 - a technically correct (as far as I can tell) definition, but it doesn't seem like a particularly tidy definition. Am I missing something here?



Any gentle prodding in the correct direction (if I'm not already there) would be appreciated

Thanks,

As far as I can tell, it accepts any words which:
a) end in 1, and
b) are either only one character long, or begin with 0.

That seems like a tidy enough definition to me...

[Rekkon]

Unless I am missing something in the notation (we never used '{}', but I assume it is the same as the error trap states we used), either of those definitions seem as simple as you can get.

[Pezzoni]

Thanks to both of you; guess I was just over-thinking it a bit