Opened 6 years ago
Closed 6 years ago
#18989 closed defect (fixed)
Incorrect input_alphabet in FiniteStateMachine.disjoint_union
Reported by: | cheuberg | Owned by: | |
---|---|---|---|
Priority: | major | Milestone: | sage-6.9 |
Component: | finite state machines | Keywords: | |
Cc: | skropf, dkrenn | Merged in: | |
Authors: | Clemens Heuberger | Reviewers: | Daniel Krenn |
Report Upstream: | N/A | Work issues: | |
Branch: | 7aa672a (Commits, GitHub, GitLab) | Commit: | 7aa672ae2d791d003b62190508847c7b6123c210 |
Dependencies: | #18557 | Stopgaps: |
Description
The following behaviour is a bug:
sage: A = Automaton([(0, 0, 0)]) sage: B = Automaton([(0, 0, 1)]) sage: A.input_alphabet [0] sage: B.input_alphabet [1] sage: (A + B).input_alphabet [0]
The resulting input alphabet should be [0, 1]
.
Change History (3)
comment:1 Changed 6 years ago by
- Branch set to u/cheuberg/fsm/disjoint_union_alphabet
- Commit set to 7aa672ae2d791d003b62190508847c7b6123c210
- Status changed from new to needs_review
comment:2 Changed 6 years ago by
- Reviewers set to Daniel Krenn
- Status changed from needs_review to positive_review
Everything looks fine.
comment:3 Changed 6 years ago by
- Branch changed from u/cheuberg/fsm/disjoint_union_alphabet to 7aa672ae2d791d003b62190508847c7b6123c210
- Resolution set to fixed
- Status changed from positive_review to closed
Note: See
TracTickets for help on using
tickets.
New commits:
Trac #18556: FiniteStateMachine.is_deterministic: several initial states
Trac #18557: Implement FiniteStateMachine.disjoint_union (and .__or__)
Trac #18557: One typo
Trac #18557: Remark on alternative notation in documentation
Trac #18989: Incorrect input_alphabet in disjoint_union