Pages that link to "Item:Q3780465"

The following pages link to A decision method for the recognizability of sets defined by number systems (Q3780465):

Displaying 21 items.

• On vanishing coefficients of algebraic power series over fields of positive characteristic (Q664335) (← links)
• Automatic maps in exotic numeration systems (Q679441) (← links)
• On number systems with finite degree of ambiguity (Q1271465) (← links)
• On D0L systems with immigration (Q1314370) (← links)
• Decidability questions related to abstract numeration systems (Q1877679) (← links)
• Minimal automaton for multiplying and translating the Thue-Morse set (Q2040011) (← links)
• Substitutive systems and a finitary version of Cobham's theorem (Q2064759) (← links)
• Automata and finite order elements in the Nottingham group (Q2132478) (← links)
• Periodicity, repetitions, and orbits of an automatic sequence (Q2271417) (← links)
• Periodicity of morphic words (Q2515198) (← links)
• Automatic Theorem-Proving in Combinatorics on Words (Q2914707) (← links)
• Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order (Q2988842) (← links)
• A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems (Q3599131) (← links)
• A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS (Q3643584) (← links)
• Cobham's Theorem seen through Büchi's Theorem (Q4630271) (← links)
• ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES (Q4902892) (← links)
• (Q5020521) (← links)
• Automatic sequences of rank two (Q5044415) (← links)
• Ultimate periodicity problem for linear numeration systems (Q5075706) (← links)
• (Q5227519) (← links)
• AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS (Q5401556) (← links)