This library should provide a building block for learning applications or any other kind of applications incorporating regular language formalisms.

It provides modellings of deterministic finite automata, nondeterministic finite automata with ε-transitions, generalized nondeterministic finite automata and formal regular expressions.

These are convertible into each other and can be manipulated w.r.t. the languages they describe. Set operations like union, intersection, complement and equality checking are possible on a language level.

Documentation

• Most recent version
  • https://reglibcpp.tomkra.nz
  • Hosted by GitLab Pages
• Archive
  • https://cs.uni-potsdam.de/~tokranz/doc
  • Hosted by the Institute for Computer Science at the University of Potsdam

Source code

• GNU General Public License version 3 licensed
• obtainable from this git repo