Uses of Package
org.inxar.syntacs.automaton.finite

Packages that use org.inxar.syntacs.automaton.finite
com.inxar.syntacs.automaton.finite Defines classes which implement determinitic finite automata and their construction. 
org.inxar.syntacs.automaton.finite Declares interfaces which model and support deterministic finite automata. 
 

Classes in org.inxar.syntacs.automaton.finite used by com.inxar.syntacs.automaton.finite
DFA
          The "Deterministic Finite Automaton" (DFA) interface abstracts a Moore state machine used to recognize discrete sequences of symbols (usually character symbols).
DFAConstructor
          Algorithms which are capable of generating a DFA from a RegularSet can be encapsulated by the DFAConstructor interface.
DFATransformer
          Algorithms which are capable of transforming some other object into a DFA can be encapsulated by the DFATransformer interface.
 

Classes in org.inxar.syntacs.automaton.finite used by org.inxar.syntacs.automaton.finite
DFA
          The "Deterministic Finite Automaton" (DFA) interface abstracts a Moore state machine used to recognize discrete sequences of symbols (usually character symbols).