• Post Reply Bookmark Topic Watch Topic
  • New Topic

Automaton NFA with backtracking  RSS feed

 
Maria Stella
Greenhorn
Posts: 25
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Hi,
I need to implement a java application for non deterministic automaton. In the class State there are the following properties:

In the classe Automaton there are:

In the class Transition there are:


I have to create the tree corresponding to the string reading input, I did the class Node where there are the properties:

and the class Edge:

but I can not build the tree.
can you help me?
Thanks
 
Junilu Lacar
Sheriff
Posts: 11476
180
Android Debian Eclipse IDE IntelliJ IDE Java Linux Mac Spring Ubuntu
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
You're going to have to show more effort than that. We won't do people's homework for them around here, we just help them figure out problems and suggest ways to improve.
 
Piet Souris
Master Rancher
Posts: 2041
75
  • Likes 1
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
hi Maria,

can you tell a little more what problem you are facing? Given your NFA, with its initial states, you get a collection of nodes when applied to the first symbol of the input string. Putting all these nodes into a list or similar, and processing these until the end states are reached, what difficulty do you encounter?
 
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
Boost this thread!