New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
New method transducers.Recursion #17221
Comments
comment:2
Needs to be rewritten to avoid using the recursion where the sequence is not defined. |
Branch pushed to git repo; I updated commit sha1. New commits:
|
This comment has been minimized.
This comment has been minimized.
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:6
Merged #17752 and adapted |
Dependencies: #17752 |
comment:7
Review of 1ab837d. Here are a couple of things that could be improved:
Apart from those things: code looks good, doc builds, tests pass. I did not check the math of the ticket, only the examples (these seem to be correct). I would be happy if someone else could help with this part. I've also made a couple of small changes (PEP8; docstrings) which I'll upload soon. |
Reviewer: Daniel Krenn |
Changed branch from u/cheuberg/fsm/generator-recursion to u/dkrenn/fsm/generator-recursion |
comment:9
Added a small reviewer patch. New commits:
|
comment:11
Cross-reviewed your reviewer patch, is fine, thank you. |
Changed branch from u/dkrenn/fsm/generator-recursion to u/cheuberg/fsm/generator-recursion |
Last 10 new commits:
|
comment:13
Replying to @dkrenn:
done: aeaebf1
done: 969160c
done: f891643 In fact, as a by-product of 85efb10, Python int cannot occur any more.
This lead to a new concept for the whole method: it is more general to interpret
I replaced the example by the weight of the ternary expansion; here it should be clearer. Concrete example and more explanations added (83f1c03).
Done: aa37aaf
Done: 9594dca |
comment:14
Apart from that, I made three more changes:
|
Changed branch from u/cheuberg/fsm/generator-recursion to u/dkrenn/fsm/generator-recursion |
Changed keywords from recursion to recursion, sd66 |
comment:17
Looks good. Tests pass. Docstrings good. Positive! New commits:
|
Changed branch from u/dkrenn/fsm/generator-recursion to u/skropf/fsm/generator-recursion |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:21
For me, it is also ok. Positive review. |
Changed reviewer from Daniel Krenn to Daniel Krenn, Sara Kropf |
comment:22
For the record: The doctest removed in 2e62790 was a duplicate. This explains its removal. |
Changed branch from u/skropf/fsm/generator-recursion to |
comment:24
Replying to @sagetrac-git:
This last commit has not been merged, see the discussion at sage-devel. Follow-up ticket is #18206. |
Changed commit from |
A new transducer generator for sequences given by recursions
a(q^K n + r) = a(q^k n + s_r) + t_r
for some0<k<K
.Depends on #17752
CC: @sagetrac-skropf @dkrenn
Component: finite state machines
Keywords: recursion, sd66
Author: Clemens Heuberger
Branch:
2cd08fb
Reviewer: Daniel Krenn, Sara Kropf
Issue created by migration from https://trac.sagemath.org/ticket/17221
The text was updated successfully, but these errors were encountered: