2017 © Pedro Peláez
 

library formal-theory

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

image

kendall-hopkins/formal-theory

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

  • Tuesday, November 27, 2012
  • by softwareelves
  • Repository
  • 2 Watchers
  • 27 Stars
  • 831 Installations
  • PHP
  • 1 Dependents
  • 0 Suggesters
  • 2 Forks
  • 4 Open issues
  • 2 Versions
  • 5 % Grown

The README.md

FormalTheory

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

  • 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, (*2)

Coming Soon™, (*3)

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

Build Status, (*4)

The Versions

27/11 2012

dev-master

9999999-dev https://github.com/KendallHopkins/FormalTheory

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

  Sources   Download

MIT

The Requires

  • php >=5.3.0

 

by Kendall Hopkins

transform lexer optimizer expression regex finite state dfa nfa deterministic nondeterministic automata regular theory formal fa

27/11 2012

1.0.0

1.0.0.0 https://github.com/KendallHopkins/FormalTheory

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

  Sources   Download

MIT

The Requires

  • php >=5.3.0

 

by Kendall Hopkins

transform lexer optimizer expression regex finite state dfa nfa deterministic nondeterministic automata regular theory formal fa