On pq-recognisable sets

MaRDI QIDQ5155673FDOQ5155673

Authors: Victor Marsault 

Publication date: 8 October 2021

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

Recommendations

• Bertrand numeration systems and recognizability
• Recognizable sets of numbers in nonstandard bases
• Characterizing simpler recognizable sets of integers
• scientific article; zbMATH DE number 1929973
• Multi-dimensional sets recognizable in all abstract numeration systems

zbMATH Keywords

rational base numeration systemsfirst-order logic characterisationp/q-recognisable setsrelations realisable by automata

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Logic and \(p\)-recognizable sets of integers
• Title not available (Why is that?)
• Powers of rationals modulo 1 and rational base number systems
• Mahler's \(Z\)-number and \(3/2\) number systems
• Number representation and finite automata
• Patterns in rational base number systems
• On sets of numbers rationally represented in a rational base number system
• Rational base number systems for \(p\)-adic numbers
• Trees and languages with periodic signature
• Abstract numeration systems
• Bertrand numeration systems and recognizability
• Title not available (Why is that?)
• ON INTEGER SEQUENCES GENERATED BY LINEAR MAPS
• First-order logic and numeration systems
• On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases

Cited In (2)

• An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
• Automatic sequences: from rational bases to trees

This page was built for publication: On \(\frac{p}{q}\)-recognisable sets

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