A decision method for the recognizability of sets defined by number systems
From MaRDI portal
Publication:3780465
Recommendations
Cites work
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- Ambiguity and decision problems concerning number systems
- Bases and ambiguity of number systems
- L codes and number systems
- On number systems with negative digits
Cited in
(25)- scientific article; zbMATH DE number 7453075 (Why is no real title available?)
- Magic Numbers in Periodic Sequences
- Enumeration and decidable properties of automatic sequences
- scientific article; zbMATH DE number 7089069 (Why is no real title available?)
- On vanishing coefficients of algebraic power series over fields of positive characteristic
- An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
- Decidability questions related to abstract numeration systems
- Büchi automata recognizing sets of reals definable in first-order logic with addition and order
- Automatic sequences of rank two
- Ultimate periodicity problem for linear numeration systems
- Automatic Theorem-Proving in Combinatorics on Words
- Ultimate periodicity of \(b\)-recognisable sets: a quasilinear procedure
- Periodicity, repetitions, and orbits of an automatic sequence
- Minimal automaton for multiplying and translating the Thue-Morse set
- On D0L systems with immigration
- Periodicity of morphic words
- Automatic theorem-proving in combinatorics on words
- Cobham's Theorem seen through Büchi's Theorem
- Automata and finite order elements in the Nottingham group
- Substitutive systems and a finitary version of Cobham's theorem
- Multi-dimensional sets recognizable in all abstract numeration systems
- Automatic maps in exotic numeration systems
- A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
- A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems
- On number systems with finite degree of ambiguity
This page was built for publication: A decision method for the recognizability of sets defined by number systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3780465)
