Member Avatar for leghorn

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 ?

  • 2 Contributors
  • 1 Reply
  • 101 Views
  • 1 Day Discussion Span
  • Latest Post Latest Post by Taywin
Member Avatar for Taywin

You need to expand the grammar to something that is more finite (in different states). Then you determine to draw DFA and/or NFA from there?

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.