some algorithm implementations for automaton and regular expressions
Project description
Introduction
This is a simple regular expression program. It implements NFA to DFA, DFA minimization and automaton visualization.
To enable plotting feature, you may need to install graphviz
Usage
from automaton_tools import DFA as MyDFA
myinput = "abc12.+qs{2,}(yui){1,2}?"
dfa = MyDFA.fromRegex(myinput)
# check whether the string matches the pattern from the beginning or not
ismatch = dfa.match("yuiyui")
# plot the transition graph
dfa.drawGraph("dfa")
# it will generate dfa.png file
Known bug
It cannot handle .
or \w
properly.
Because they are considered as a special kind of characters.
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
automaton_tools-0.1.8.tar.gz
(14.3 kB
view hashes)
Built Distribution
Close
Hashes for automaton_tools-0.1.8-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | ab37779fcd31180e866d1b9da9f00a3c9659fd9c86c3ba6ccc229e9640e7d662 |
|
MD5 | 17a547f9948ef219fec8e2352f509b7a |
|
BLAKE2b-256 | 6c7e989b983a91a80db44e75cfe3f62302389e7a090178ac6b3ac598040945ab |