Open c165f187-4f33-4a54-8b5c-49666d3fe91f opened 10 years ago
Branch: u/mercatp/ticket/15883
Commit: 8be52e6
Branch pushed to git repo; I updated commit sha1. New commits:
92a9bce | Tools to manipulate beta-adic monoids with subshifts, with doc. |
Branch pushed to git repo; I updated commit sha1. New commits:
993085f | Get the right files c_graph and polynomial_quotient_ring_element. |
Branch pushed to git repo; I updated commit sha1. New commits:
da9af96 | I corrected a bug in the doc of plot(). |
Branch pushed to git repo; I updated commit sha1. New commits:
d7648df | Adds a function complexity to BetaAdicMonoid and correct some bugs of documentation |
Branch pushed to git repo; I updated commit sha1. New commits:
f759c8f | Correct a bug introduced in the previous commit. |
Branch pushed to git repo; I updated commit sha1. New commits:
6ccfbd3 | Add some doc, and a limit in BetaAdicMonoid.reduced_words_automaton(), and change little things in relations_automaton() |
Branch pushed to git repo; I updated commit sha1. New commits:
6ea2f1b | Improve verbose of reduced_words_automaton() |
Branch pushed to git repo; I updated commit sha1. New commits:
e99d542 | Improve verbose of BetaAdicMonoid.relations_automaton() |
Branch pushed to git repo; I updated commit sha1. New commits:
cf8e9c8 | Add a non-recursive version of BetaAdicMonoid.relations_automaton and correct some bugs. |
Maybe sage.combinat.finite_state_machine.Automaton
is of interest for this implementation.
Replying to @dkrenn:
Maybe
sage.combinat.finite_state_machine.Automaton
is of interest for this implementation.
Yes, thank you. I developped that before the existence of this class Automaton I think. But there are better things with my implementation : the determinisation works better and I can determinise and take the complementary I one step that is better for what I do. But I agree, I should use the class Automaton now.
Branch pushed to git repo; I updated commit sha1. New commits:
43b1ee6 | Add a non-recursive version of combinat/words/Automaton/determinize |
Branch pushed to git repo; I updated commit sha1. New commits:
3875bbf | Add a tool to simplify the intersection of two beta-adic monoids. |
Branch pushed to git repo; I updated commit sha1. New commits:
15a5820 | Correct some small bugs. |
Branch pushed to git repo; I updated commit sha1. New commits:
afd3e72 | Improve things in sage.combinat.words.automata (add new functions, correct some problems and improve some things) and in sage.monoids.beta_adic_monoids |
Branch pushed to git repo; I updated commit sha1. New commits:
de0136c | Avoid a bug of sage.combinat.words.automata.product2 when the dictionnary passed has not all the possible keys. |
Branch pushed to git repo; I updated commit sha1. New commits:
1f36217 | Improve emonde0_simplify() from sage.combinat.words.automata. |
I create tools to manipulate finite automaton : minimize, determinize, etc... I create tools to manipulate beta-adic monoids (with eventually a subshift of finite type). And you can compute finite automata from a beta-adic monoid (with or without subshift) : see http://www.latp.univ-mrs.fr/~paul.mercat/Publis/Semi-groupes%20fortement%20automatiques.pdf for more details. You can use these tools to compute some data about some Rauzy fractals, as the Hausdorff dimension of the boundary.
Component: combinatorics
Branch/Commit: u/mercatp/ticket/15883 @
1f36217
Issue created by migration from https://trac.sagemath.org/ticket/15883