kendall-hopkins/formal-theory

FormalTheory is a library that allows for manipulation and conversion of NFAs, DFAs and Regular Expressions.

Maintainers

Details

github.com/KendallHopkins/FormalTheory

Homepage

Source

Issues

Installs: 1 218

Dependents: 1

Suggesters: 0

Security: 0

Stars: 33

Watchers: 5

Forks: 5

Open Issues: 4

1.0.0 2012-11-27 07:25 UTC

Requires

  • php: >=5.3.0

MIT 81f8957ee52fe7b561a9454c5d9661dd5fc9751f

  • Kendall Hopkins <softwareelves.woop@gmail.com>

statetransformexpressionformaltheoryregexregulardfanfafadeterministicnondeterministicfiniteautomatalexeroptimizer

This package is not auto-updated.

Last update: 2024-12-21 13:33:23 UTC

README

FormalTheory is a library that allows for manipulation and conversion of NFAs, DFAs and Regular Expressions. Some of the features it includes are:

  • Regex Lexing (AST)
  • Regex to NFA conversion
  • NFA to DFA conversion (determinize)
  • DFA minimization
  • DFA solution counting
  • FA equality
  • FA superset/subset test
  • FA proper superset/subset test
  • FA has a valid solution
  • FA print
  • FA export as DOT
  • FA string matching
  • FA intersections
  • FA unions
  • FA negation
  • FA reverse
  • FA to Regex conversion (basic)
  • Heavy Unit Test Coverage
  • Modern Autoloading Support
  • Regex optimization via rules

Note: FA is either a DFA or NFA

Coming Soon™

  • Regex optimization via mutations
  • Generalized DFA solving based on positive/negative match list

Build Status