Hi all
Consider a language defined by L={AnBm | n,m >= 0} and also that it is a regular language.
How is it possible to draw its DFA n NFA ?
leghorn
0
Newbie Poster
Taywin
312
Posting Virtuoso
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.