Difference between revisions of "XFA"
(Created page with "{{Entry |Name=XFA |Short description=Portable finite state automata library |Full description=The XFA library implements an API that can be used to create NFA (either programmati...") |
(New version) |
||
| Line 3: | Line 3: | ||
|Short description=Portable finite state automata library | |Short description=Portable finite state automata library | ||
|Full description=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. | |Full description=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. | ||
| + | |Homepage URL=http://www.xmailserver.org/xfa-lib.html | ||
|User level=none | |User level=none | ||
| − | |||
| − | |||
| − | |||
| − | |||
|Computer languages=C | |Computer languages=C | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
|Keywords=library,state,NFA,DFA,automata,regular,expression | |Keywords=library,state,NFA,DFA,automata,regular,expression | ||
| − | | | + | |Version identifier=0.18 |
| − | |Last review by= | + | |Version date=2009/01/08 |
| − | |Last review date= | + | |Version status=stable |
| + | |Version download=http://www.xmailserver.org/xfa-0.18.tar.gz | ||
| + | |Version comment=0.18 released on 2009-01-08 | ||
| + | |Last review by=Alejandroindependiente | ||
| + | |Last review date=2017/01/03 | ||
|Submitted by=Database conversion | |Submitted by=Database conversion | ||
|Submitted date=2011-04-01 | |Submitted date=2011-04-01 | ||
| − | | | + | |Status= |
| − | | | + | |Is GNU=No |
| − | | | + | |License verified date=2006-01-15 |
| − | | | + | }} |
| + | {{Project license | ||
| + | |License=GPLv2 | ||
| + | |License verified by=Ted Teah | ||
|License verified date=2006-01-15 | |License verified date=2006-01-15 | ||
| − | |||
}} | }} | ||
{{Person | {{Person | ||
| + | |Real name=Davide Libenzi | ||
|Role=Maintainer | |Role=Maintainer | ||
| − | |||
|Email=davidel@xmailserver.org | |Email=davidel@xmailserver.org | ||
|Resource URL= | |Resource URL= | ||
| Line 42: | Line 39: | ||
|Interface=library | |Interface=library | ||
}} | }} | ||
| − | {{ | + | {{Featured}} |
| − | |||
| − | |||
| − | |||
| − | }} | ||
Latest revision as of 08:46, 3 January 2017
XFA
http://www.xmailserver.org/xfa-lib.html
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.
Licensing
License
Verified by
Verified on
Notes
Leaders and contributors
| Contact(s) | Role |
|---|---|
| Davide Libenzi | Maintainer |
Resources and communication
| Audience | Resource type | URI |
|---|---|---|
| Bug Tracking,Developer,Help,Support | mailto:davidel@xmailserver.org |
Software prerequisites
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.