Self-verifying predicates in Büchi arithmetic

DOI10.1007/978-3-032-02602-6_17MaRDI QIDQ6861677zbMATH OpenFDO

Authors Mazen Khodier, Luke Schaeffer, Jeffrey Shallit

Publication date 10 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-02602-6_17

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Automatic Sequences
• Automatic sequences in negative bases and proofs of some conjectures of shevelev
• Bertrand numeration systems and recognizability
• Decision algorithms for Fibonacci-automatic words. I: Basic results.
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 2152304 (Why is no real title available?)
• scientific article; zbMATH DE number 891076 (Why is no real title available?)
• Learning regular sets from queries and counterexamples
• Linear recurrence sequence automata and the addition of abstract numeration systems
• Logic and p-recognizable sets of integers
• Rarefied Thue-Morse sums via automata theory and logic
• Representations of numbers and finite automata
• Rudin-Shapiro sums via automata theory and logic
• Some properties of the Tribonacci sequence
• Synchronized sequences
• The Logical Approach to Automatic Sequences

This page was built for publication: Self-verifying predicates in Büchi arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6861677)