Add to ORKG17 pagesWe introduce the notion of an asymptotically automatic sequence, which generalises the notion of an automatic sequence, and we prove a variant of Cobham's theorem for the newly introduced class of sequences
Abstract. We present some asymptotic results about the frequency of a letter appearing in a generali...
We present some asymptotic results about the frequency of a letter appearing in a generalized unidim...
This book is the first integrated treatment of sequences generated by finite automata and their gene...
17 pagesWe introduce the notion of an asymptotically automatic sequence, which generalises the notio...
Automatic sequences are sequences which are produced by a finite automaton. Although they are not ra...
International audienceCobham's theorem asserts that if a sequence is automatic with respect to two m...
Abstract. A sequence is said to be k-automatic if the n th term of this sequence is generated by a f...
AbstractWe generalize the uniform tag sequences of Cobham, which arise as images of fixed points of ...
AbstractIn an automatic sequence an element need not have an asymptotic density. In this paper a nec...
Tematem pracy jest twierdzenie Cobhama. W pierwszej części wprowadzono podstawowe definicje związane...
AbstractThis paper obtains upper and lower bounds for the asymptotic behavior of the codimension seq...
peer reviewedWe make certain bounds in Krebs’ proof of Cobham’s theorem explicit and obtain correspo...
AMS Subject Classication: 11B85, 68Q45, 16W22, 18DXX Abstract. We present an abstract, yet rather na...
AbstractWe revisit a technique of S. Lehr on automata and use it to prove old and new results in a s...
AbstractA sequence is said to be k-automatic if the nth term of this sequence is generated by a fini...
Abstract. We present some asymptotic results about the frequency of a letter appearing in a generali...
We present some asymptotic results about the frequency of a letter appearing in a generalized unidim...
This book is the first integrated treatment of sequences generated by finite automata and their gene...
17 pagesWe introduce the notion of an asymptotically automatic sequence, which generalises the notio...
Automatic sequences are sequences which are produced by a finite automaton. Although they are not ra...
International audienceCobham's theorem asserts that if a sequence is automatic with respect to two m...
Abstract. A sequence is said to be k-automatic if the n th term of this sequence is generated by a f...
AbstractWe generalize the uniform tag sequences of Cobham, which arise as images of fixed points of ...
AbstractIn an automatic sequence an element need not have an asymptotic density. In this paper a nec...
Tematem pracy jest twierdzenie Cobhama. W pierwszej części wprowadzono podstawowe definicje związane...
AbstractThis paper obtains upper and lower bounds for the asymptotic behavior of the codimension seq...
peer reviewedWe make certain bounds in Krebs’ proof of Cobham’s theorem explicit and obtain correspo...
AMS Subject Classication: 11B85, 68Q45, 16W22, 18DXX Abstract. We present an abstract, yet rather na...
AbstractWe revisit a technique of S. Lehr on automata and use it to prove old and new results in a s...
AbstractA sequence is said to be k-automatic if the nth term of this sequence is generated by a fini...
Abstract. We present some asymptotic results about the frequency of a letter appearing in a generali...
We present some asymptotic results about the frequency of a letter appearing in a generalized unidim...
This book is the first integrated treatment of sequences generated by finite automata and their gene...