Link Details

Link 967505 thumbnail
User 421856 avatar

By mdbenassi
via github.com
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
  • 453
  • 43442

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.

Voters For This Link (1)



Voters Against This Link (0)



    Debugging JavaScript
    Written by: Ashutosh Sharma
    Featured Refcardz: Top Refcardz:
    1. Design Patterns
    2. OO JS
    3. Cont. Delivery
    4. Java EE7
    5. HTML5 Mobile
    1. Java EE7
    2. Spring Annotations
    3. Git
    4. Java
    5. REST