Multiset rewriting over Fibonacci and tribonacci numbers
From MaRDI portal
Publication:2453583
DOI10.1016/j.jcss.2014.04.006zbMath1327.68143MaRDI QIDQ2453583
Publication date: 10 June 2014
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2014.04.006
Fibonacci numbers; confluence; integer partitions; termination; partition identities; Church-Rosser property; multiset rewriting; tribonacci numbers; \(k\)-step Fibonacci numbers
05A17: Combinatorial aspects of partitions of integers
68Q42: Grammars and rewriting systems
11B39: Fibonacci and Lucas numbers and polynomials and generalizations
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The two-way rewriting in action: removing the mystery of Euler-Glaisher's map
- Bijections for partition identities
- Bijective proofs of some classical partition identities
- Sieve-equivalence and explicit bijections
- Sieve equivalence in generalized partition theory
- Systems of Numeration
- Method for constructing bijections for classical partition identities
- A Note on Rewriting Proofs and Fibonacci Numbers