The XFA library is a Finite Automata (FA) library to handle tasks like building (programmatically or from regular expressions), converting NFA (Non-deterministic FA) to DFA (Deterministic FA) and reducing FA graphs.
The library relies only on the availability of an ANSI C compiler, and in this way can be used in almost every system (from embedded devices to servers).
The XFA library uses the concepts of state and transaction to define an arbitrarly complex FA graph, where states are connected by transactions.
The library supply both low level graph building capabilities and regular expression driven graph construction. The complexity of the graphs that are treatable by the XFA library is only limited by the amount of available memory.