-
```
Not a bug but I've found the parser is a bit too slow for my needs.
I've attached some pretty minor changes that (on my machine at least) make it
over 10x faster... hope you find it useful - than…
-
```
Not a bug but I've found the parser is a bit too slow for my needs.
I've attached some pretty minor changes that (on my machine at least) make it
over 10x faster... hope you find it useful - than…
-
``` haskell
> let example = (Concat (Literal 'c') (Repeat (Literal 'd')))
> "c" `matches` example
=> False
```
But "c" should matches "cd*", right?
-
Doctests from article Heuberger, Krenn and Kropf, Automata and Transducers in the Computer Algebra System Sage, :arxiv:`1404.7458` should be included in src/sage/tests.
Depends on #16580
CC: @ch…
-
Hi there ... I saw you use O(n) algorithms to search for known anti vm patterns ( and generally speaking for known patterns from userdb ) ... no need to say, if you plan to make your db bigger ( and m…
-
Build an extensible AIComponent and AISystem that uses FA to model behaviour.
- States (vertices) contain a "Directive" which can ask the MovementSystem/CombatSystem for certain things ("Hey, I want t…
-
The following code gives a stack overflow error:
```
(enumeration-query
;;this machine makes a widget -- which we'll just represent with a real number:
(define (widget-maker) (multinomial '(.2 …
-
Intersection now constructs the automaton (or transducer) which accepts (computes) the intersection
of the languages of the given automata (transducers). This was earlier done by cartesian_product.…
-
Nevertheless, intersection and union are still not implemented. Thus, this only changes the names of the functions. Previously `__mul__` called intersection and `__add__` called union.
This is an a…
-
Issue for discussion on improvements to and refactoring of the parser. Current associated tasks:
- [x] Clean up `_parse_recursive()` by factoring out parsing into methods
- [x] Add support for parsing…