Link Details

Link 967505 thumbnail
User 421856 avatar

By mdbenassi
Submitted: May 11 2013 / 09:06

jDFA is an Event-Based Deterministic Finite Automaton implementation in Java. jDFA is inspired from Erlang design principles which describe a Finite State Machine as a set of relations of the form: State(S) x Event(E) -> Actions(A), State(S') These relations are interpreted as meaning: If we are in state S and the event E occurs, we should perform the actions A and make a transition to the state S'.
  • 1
  • 0
  • 479
  • 43445

Add your comment

Html tags not supported. Reply is editable for 5 minutes. Use [code lang="java|ruby|sql|css|xml"][/code] to post code snippets.

Upvoters (1)

Downvoters (0)

    Apache Hadoop
    Written by: Piotr Krewski
    Featured Refcardz: Top Refcardz:
    1. Play
    2. Akka
    3. Design Patterns
    4. OO JS
    5. Cont. Delivery
    1. Play
    2. Java Performance
    3. Akka
    4. REST
    5. Java