From Free Software Directory
Jump to: navigation, search



Portable finite state automata library

The XFA library implements an API that can be used to create NFA (either programmatically or from regular expressions) and to convert them in the minimal equivalent DFA. The XFA library only requirement is an ANSI C compiler, and this makes it portable virtually over every system. The complexity of the graphs that are treatable with XFA is only limited by the amount of memory available on the machine.



version 0.18 (stable)
released on 8 January 2009




Verified by

Verified on


Verified by

Ted Teah

Verified on

15 January 2006

Leaders and contributors

Davide Libenzi Maintainer

Resources and communication

AudienceResource typeURI
Bug Tracking,Developer,Help,SupportE-mailmailto:davidel@xmailserver.org

Software prerequisites

This entry (in part or in whole) was last reviewed on 3 January 2017.


Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.

The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.