Hi!
I have the following exercise:
"Draw the deterministic finite automata using a state diagram so that accepts the language {λ ε {a,b}*: each a in the word λ appears only after or before a b}."
How many states do I have??
CodeGuru Home | VC++ / MFC / C++ | .NET / C# | Visual Basic | VB Forums | Developer.com |
Results 1 to 1 of 1
Threaded View
|
Click Here to Expand Forum to Full Width |