A decision method for the recognizability of sets defined by number systems
From MaRDI portal
Publication:3780465
DOI10.1051/ita/1986200403951zbMath0639.68074OpenAlexW118064341MaRDI QIDQ3780465
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
Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Radix representation; digital problems (11A63)
Related Items (22)
Decidability questions related to abstract numeration systems ⋮ Automatic sequences of rank two ⋮ Automata and finite order elements in the Nottingham group ⋮ Automatic Theorem-Proving in Combinatorics on Words ⋮ Ultimate periodicity problem for linear numeration systems ⋮ Unnamed Item ⋮ Magic Numbers in Periodic Sequences ⋮ Unnamed Item ⋮ Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order ⋮ Cobham's Theorem seen through Büchi's Theorem ⋮ On vanishing coefficients of algebraic power series over fields of positive characteristic ⋮ ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES ⋮ AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS ⋮ Automatic maps in exotic numeration systems ⋮ Periodicity, repetitions, and orbits of an automatic sequence ⋮ A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems ⋮ Periodicity of morphic words ⋮ Minimal automaton for multiplying and translating the Thue-Morse set ⋮ On number systems with finite degree of ambiguity ⋮ A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS ⋮ Substitutive systems and a finitary version of Cobham's theorem ⋮ On D0L systems with immigration
Cites Work
This page was built for publication: A decision method for the recognizability of sets defined by number systems
