Robbins and Ardila meet Berstel

DOI10.1016/j.ipl.2020.106081OpenAlexW3116224586MaRDI QIDQ2656345

Jeffrey O. Shallit

Publication date: 11 March 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.14930

zbMATH Keywords

combinatorial problemslinear representationformal languagesautomatonFibonacci partition

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

A General Approach to Proving Properties of Fibonacci Representations via Automata Theory ⋮ On Fibonacci partitions

Uses Software

• Grail

Cites Work

• \textit{Grail}: A C++ library for automata and expressions
• Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties
• An Exercise on Fibonacci Representations
• Synchronizing Automata and the Černý Conjecture
• Notes on Fibonacci Partitions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Robbins and Ardila meet Berstel