ProgrammingThis forum is for all programming questions.
The question does not have to be directly related to Linux and any language is fair game.
Welcome to LinuxQuestions.org, a friendly and active Linux Community.
You are currently viewing LQ as a guest. By joining our community you will have the ability to post topics, receive our newsletter, use the advanced search, subscribe to threads and access many other special features. Registration is quick, simple and absolutely free. Join our community today!
Note that registered members see fewer ads, and ContentLink is completely disabled once you log in.
If those "automata" are separate programs, try executing them with the appropriate call from your JAVA script, capture the output, and process it. If they have a "callable" interface, write code to invoke the application using its interface.
On the other hand, if the "automata" are algorithms that you are supposed to code in JAVA as a class project, well, you'll learn more by doing that task. (Since it's a "university" for which you are doing the project, I was wondering if the "project" as a class assignment.)
Bottom line: Your question seem to lack sufficient detail, and can only be answered in very general terms. You tell neither what the "automata" are, nor how they are to be used, nor what your system design looks like, nor what you've already tried.
Last edited by PTrenholme; 05-03-2008 at 01:55 PM.
finite automata are a composition of states and transitions.
so i have to look for the 'passive-agent'in a text, like : john was hit by paul --> paul would be what i was looking for
so, i have written rules in the form of automata:
start ->(1) -P-> (2)-NP->((3))
1,2 and 3 representing states and P being my preposition "by" and NP being my noun phrase . 3 is the final state and i the initial .
all in all , i have come up with 10 automata .
I have searched java tutorials and automata-tutorials , non combine both !
yes, this is an assignement for my university and i am not asking that someone do it for me, i am frustrated, cause i dont know WHERE to look for information that could "shed some light" on this transformation process i.e how should i proceed with writing such algorithms ??
So, basically, you're asking "How do I program a FSM in JAVA?"
I don't use JAVA much (and my JAVA text is packed right now), but I do know that it implements an if statement and it may have a switch statement. I think you could program any FSM using either of those constructs.
Strange. Those are standard SourceForge projects, and both open for me. The latest FSM generator claims to create JAVA code to implement a FSM, so running it may give you a good example of how a FSM could be coded.
Note, of course, that using generated code is not a good way to learn how to code.