Open c165f187-4f33-4a54-8b5c-49666d3fe91f opened 10 years ago
Branch pushed to git repo; I updated commit sha1. New commits:
65ba2ce | Add a structure NAutomaton that permits to represent non-deterministic automata, and add a transposition of deterministic automaton (that gives a non-deterministic one) and a function determinise to get back a deterministic automaton. |
Branch pushed to git repo; I updated commit sha1. New commits:
b590f0e | Correct the computing of the extended relation automaton of a beta-adic monoid. |
Branch pushed to git repo; I updated commit sha1. New commits:
ba30283 | Improve function is_final() and convert function get_la() to use FastAutomaton and not Automaton. Load class FastAutomaton at start. |
Branch pushed to git repo; I updated commit sha1. New commits:
8efcdea | Merge branch 'master' into t/16723/beta-adic |
Branch pushed to git repo; I updated commit sha1. New commits:
fda86b7 | Add a function piece to FastAutomaton, add intersection2 and intersect to BetaAdicMonoid |
Branch pushed to git repo; I updated commit sha1. New commits:
3af2ddf | Add a function is_all_connected() to BetaAdicMonoid that decides if all the tiles of the self-similar tiling are connected. |
Branch pushed to git repo; I updated commit sha1. New commits:
b5a7107 | Add `__hash__` and `__cmp__` functions to FastAutomaton, correct the test of equality, improve is_all_connected of BetaAdicMonoid, replace spaces by tabs for indentation and correct some bugs. |
Branch pushed to git repo; I updated commit sha1. New commits:
e4c6241 | Forget to add file src/sage/combinat/words/automataC.c |
Branch pushed to git repo; I updated commit sha1. New commits:
ae245aa | Add a tool to compute relations automata with translation and change a lot of little things. |
Branch pushed to git repo; I updated commit sha1. New commits:
8c1bf8a | Add a function move2() that compute the translate ( replace move() ), and correct some problems. |
Branch pushed to git repo; I updated commit sha1. New commits:
a45bb65 | Add a function zero_complete() for FastAutomaton, a function shift for BetaAdicMonoid (not well tested) and correct some little things. |
Branch pushed to git repo; I updated commit sha1. New commits:
effde91 | Add a function add_edge() to FastAutomaton and correct some bugs. |
Branch pushed to git repo; I updated commit sha1. New commits:
42b95c5 | Add functions rec_word() and find_word() to FastAutomaton, and modify function is_empty(). |
Branch pushed to git repo; I updated commit sha1. New commits:
7ae36cb | Correct some memory bugs. |
This ticket gives a implementation of beta-adic monoids, as described in the article http://www.latp.univ-mrs.fr/~paul.mercat/Publis/Semi-groupes%20fortement%20automatiques.pdf It permit to compute the beta-adic monoid corresponding to a WordMorphism, to draw limit sets of beta-adic monoid, to compute relations automaton and reduced words automaton (defined in the article). For that I re-implemented the Automata.
This ticket is too big to be included directly into sage : I forsee to cut it in small parts that I will try to include in sage when it will be completly implemented, documented and well tested.
CC: @sagetrac-tjolivet
Component: PLEASE CHANGE
Branch/Commit: u/mercatp/beta-adic @
7ae36cb
Issue created by migration from https://trac.sagemath.org/ticket/16723