A decision method for the recognizability of sets defined by number systems

DOI10.1051/ITA/1986200403951zbMATH Open0639.68074OpenAlexW118064341MaRDI QIDQ3780465FDOQ3780465

Authors: Juha Honkala 

Publication date: 1986

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92267

Recommendations

• On number systems with finite degree of ambiguity
• Decidability questions related to abstract numeration systems
• scientific article; zbMATH DE number 3993564
• Ultimate periodicity of \(b\)-recognisable sets: a quasilinear procedure
• scientific article; zbMATH DE number 168432

zbMATH Keywords

decidabilitynumber systemsrecognizable set

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Radix representation; digital problems (11A63) Decidability of theories and sets of sentences (03B25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On number systems with negative digits
• L codes and number systems
• Ambiguity and decision problems concerning number systems
• Bases and ambiguity of number systems

Cited In (25)

• Title not available (Why is that?)
• Magic Numbers in Periodic Sequences
• Enumeration and decidable properties of automatic sequences
• Title not available (Why is that?)
• An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
• On vanishing coefficients of algebraic power series over fields of positive characteristic
• 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
• Ultimate periodicity of \(b\)-recognisable sets: a quasilinear procedure
• Automatic Theorem-Proving in Combinatorics on Words
• 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)