-
It is common for there to be pairs of states in finite automata with transitions back and forth between them.
Due to the simplicity of the current transition-drawing algorithm, this would displ…
-
I enjoyed the write-up. One thing you don't really mention is the basis for packages in Nix, I'm not sure how it compares with GUIX, but from what I've seen Nix is basically just mapping a hash to a p…
-
This is not really an installation issue, but rather a problem in building the docs (not really a bug either).
I cloned the latest and greatest main branch, and I installed all the dependencies thr…
-
Submitting Author: Name (@eliotwrobson)
Package Name: automata
One-Line Description of Package: A Python library for simulating finite automata, pushdown automata, and Turing machines
Repository …
-
I want an API that allows me to get the min DFA for a particular regex, for example, take this regex `"(a|b)+d"`, I would want a min DFA of this nature,
![image](https://github.com/rust-lang/regex…
-
sh4wn updated
1 month ago
-
While using the `DFA.from_finite_language()` method to create a basic DFA from a finite language and then applying dfa.minify(), the resulting DFA incorrectly introduces a loop that allows an infinite…
-
Since switching to networkx there seems to have been a degradation in speed for DFAs with a large number of final states.
For example I have one with 3348 final states and 11312 states in total.
The…
Tagl updated
8 months ago
-
**1、Following are my system setups:**
OS: Ubuntu 18.04 bionic
Python version: 3.8
Conda Environment: YES
**2、Issue description:**
I first used 'cmake -DCMAKE_INSTALL_PREFIX="$CONDA_PREFIX" -DBO…
-
**Is your feature request related to a problem? Please describe.**
When implementing autocomplete application, most of the queries are incomplete words.
Sometimes misspells happen in incomplete qu…