On the public citation graph
Uniform tag sequences
0 signed · 438 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/malq.19600060105openalex-snapshot
Weak Second‐Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_22openalex-snapshot
Weak Second-Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1007/bf01691062openalex-snapshot
Endomorphisms and automorphisms of the shift dynamical system
inferredcites →https://doi.org/10.1007/bf01746527openalex-snapshot
On the base-dependence of sets of numbers recognizable by finite automata
inferredcites →https://doi.org/10.1016/0016-0032(60)90676-1openalex-snapshot
An introduction to the theory of numbers
inferredcites →https://doi.org/10.1016/0020-0271(67)90007-1openalex-snapshot
The mathematical theory of context-free languages
inferredcites →https://doi.org/10.1016/s0022-0000(70)80012-5openalex-snapshot
Time-restricted sequence generation
inferredcites →https://doi.org/10.1017/s1446788700027750openalex-snapshot
On digital distribution in some integer sequences
inferredcites →https://doi.org/10.1080/00029890.1966.11970894openalex-snapshot
On the Probability that a Random Integer has Initial Digit A
inferredcites →https://doi.org/10.1090/s0002-9939-1969-0244149-8openalex-snapshot
On the Number of Binary Digits in a Multiple of Three
inferredcites →https://doi.org/10.1090/s0002-9947-1961-0139530-9openalex-snapshot
Decision problems of finite automata design and related arithmetics
inferredcites →https://doi.org/10.1090/s0002-9947-1965-0170805-7openalex-snapshot
On the Computational Complexity of Algorithms
inferredcites →https://doi.org/10.1093/oso/9780199219858.001.0001openalex-snapshot
An Introduction To The Theory Of Numbers
inferredcites →https://doi.org/10.1109/pgec.1966.264363openalex-snapshot
Continuity and Realizability of Sequence Transformations
inferredcites →https://doi.org/10.1109/swat.1968.20openalex-snapshot
On the hartmanis-stearns problem for a class of tag machines
inferredcites →https://doi.org/10.1109/tec.1962.5219459openalex-snapshot
Real-Time Computation and Recursive Functions Not Real-Time Computable
inferredcites →https://doi.org/10.1145/321186.321196openalex-snapshot
Finite Automata and the Set of Squares
inferredcites →https://doi.org/10.1145/321466.321470openalex-snapshot
On the Recognition of Primes by Automata
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems
inferredcites →https://doi.org/10.2307/2313471openalex-snapshot
Computation: Finite and Infinite Machines.
inferredcites →https://doi.org/10.2307/3609182openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
inferredcites →https://doi.org/10.4064/fm-65-1-33-42openalex-snapshot
Finitely additive measures and the first digit problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/eujc.1998.0206openalex-snapshot
Generalized Perturbed Symmetry
inferred← citeshttps://doi.org/10.1006/eujc.2000.0394openalex-snapshot
An Equivalence Relation on {0,1}*
inferred← citeshttps://doi.org/10.1006/jcss.1996.0046openalex-snapshot
Automaticity I: Properties of a Measure of Descriptional Complexity
inferred← citeshttps://doi.org/10.1006/jnth.1997.2175openalex-snapshot
Transcendence of Numbers with a Low Complexity Expansion
inferred← citeshttps://doi.org/10.1007/0-387-23639-2_1openalex-snapshot
Algebraic Dynamics of Certain Gamma Function Values
inferred← citeshttps://doi.org/10.1007/0-387-23639-2_8openalex-snapshot
Duality in Fractional Programming Problems with Set Constraints
inferred← citeshttps://doi.org/10.1007/11505877_1openalex-snapshot
Restricted Towers of Hanoi and Morphisms
inferred← citeshttps://doi.org/10.1007/11505877_35openalex-snapshot
On the Frequency of Letters in Pure Binary Morphic Sequences
inferred← citeshttps://doi.org/10.1007/3-540-07162-8_662openalex-snapshot
Mathematical methods of the theory of stochastic automata
inferred← citeshttps://doi.org/10.1007/3-540-45463-2_17openalex-snapshot
Algebraic and Analytic Randomness
inferred← citeshttps://doi.org/10.1007/3-540-45463-2_18openalex-snapshot
From Symbolic Dynamics to a Digital Approach: Chaos and Transcendence
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_51openalex-snapshot
Characterizing Simpler Recognizable Sets of Integers
inferred← citeshttps://doi.org/10.1007/3-540-52282-4_28openalex-snapshot
The ring of k-regular sequences
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_210openalex-snapshot
Iterative devices generating infinite words
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_66openalex-snapshot
On the subword equivalence problem for infinite words
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_67openalex-snapshot
On the separators on an infinite word generated by a morphism
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_82openalex-snapshot
A family of tag systems for paperfolding sequences
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_87openalex-snapshot
Recognizable sets of numbers in nonstandard bases
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_164openalex-snapshot
Polynomial automaticity, context-free languages, and fixed points of morphisms (Extended abstract)
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_266openalex-snapshot
Growth Phenomena in Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-1-4471-0551-0_1openalex-snapshot
The Ubiquitous Prouhet-Thue-Morse Sequence
inferred← citeshttps://doi.org/10.1007/978-1-4471-0551-0_16openalex-snapshot
Automaticity of Solutions of Mahler Equations
inferred← citeshttps://doi.org/10.1007/978-1-4612-1544-8_22openalex-snapshot
Number Theory and Formal Languages
inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_96openalex-snapshot
Growth Phenomena in Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-1-4614-6642-0_1openalex-snapshot
Life and Mathematics of Alfred Jacobus van der Poorten (1942–2010)
inferred← citeshttps://doi.org/10.1007/978-1-4614-6642-0_5openalex-snapshot
Transcendence of Stammering Continued Fractions
inferred← citeshttps://doi.org/10.1007/978-1-4757-4269-5_13openalex-snapshot
Propriétés arithmétiques des substitutions
inferred← citeshttps://doi.org/10.1007/978-1-4939-8700-9_266openalex-snapshot
Growth Phenomena in Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-40608-0_18openalex-snapshot
Complexity of Automatic Sequences
inferred← citeshttps://doi.org/10.1007/978-3-030-57666-0_5openalex-snapshot
From Combinatorial Games to Shape-Symmetric Morphisms
inferred← citeshttps://doi.org/10.1007/978-3-030-84304-5_18openalex-snapshot
Support of an Algebraic Series as the Range of a Recursive Sequence
inferred← citeshttps://doi.org/10.1007/978-3-031-05578-2_6openalex-snapshot
Prefix Palindromic Length of the Sierpinski Word
inferred← citeshttps://doi.org/10.1007/978-3-031-33180-0_16openalex-snapshot
Magic Numbers in Periodic Sequences
inferred← citeshttps://doi.org/10.1007/978-3-031-33180-0_18openalex-snapshot
Rudin-Shapiro Sums via Automata Theory and Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-33180-0_19openalex-snapshot
Automaticity and Parikh-Collinear Morphisms
inferred← citeshttps://doi.org/10.1007/978-3-031-33180-0_22openalex-snapshot
Characteristic Sequences of the Sets of Sums of Squares as Columns of Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-40247-0_20openalex-snapshot
Transduction of Automatic Sequences and Applications
inferred← citeshttps://doi.org/10.1007/978-3-032-32016-2_11openalex-snapshot
State Complexity of Shifts of the Fibonacci Word
inferred← citeshttps://doi.org/10.1007/978-3-0348-6073-4_3openalex-snapshot
Interessante reelle Zahlen
inferred← citeshttps://doi.org/10.1007/978-3-319-09698-8_21openalex-snapshot
Eigenvalues and Transduction of Morphic Sequences
inferred← citeshttps://doi.org/10.1007/978-3-319-09698-8_22openalex-snapshot
Breadth-First Serialisation of Trees and Rational Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-20028-6_4openalex-snapshot
A New Approach to the Paperfolding Sequences
inferred← citeshttps://doi.org/10.1007/978-3-319-21500-6_28openalex-snapshot
Surminimisation of Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-23111-2_1openalex-snapshot
Decidability Problems for Self-induced Systems Generated by a Substitution
inferred← citeshttps://doi.org/10.1007/978-3-319-23660-5_15openalex-snapshot
Mechanical Proofs of Properties of the Tribonacci Word
inferred← citeshttps://doi.org/10.1007/978-3-319-62809-7_11openalex-snapshot
Undecidability and Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_5openalex-snapshot
An Exercise on the Average Number of Real Zeros of Random Real Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-540-39910-0_31openalex-snapshot
Digital Algebra and Circuits
inferred← citeshttps://doi.org/10.1007/978-3-540-73208-2_34openalex-snapshot
On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases
inferred← citeshttps://doi.org/10.1007/978-3-540-78967-3_16openalex-snapshot
Second Preimage Attacks on Dithered Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-88282-4_27openalex-snapshot
Counting Ordered Patterns in Words Generated by Morphisms
inferred← citeshttps://doi.org/10.1007/978-3-642-03351-3_26openalex-snapshot
Aperiodicity Measure for Infinite Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_45openalex-snapshot
On the Recognizability of Self-generating Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-14455-4_20openalex-snapshot
On the Periodicity of Morphic Words
inferred← citeshttps://doi.org/10.1007/978-3-642-14455-4_6openalex-snapshot
Numeration Systems: A Link between Number Theory and Formal Language Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-18487-1_46openalex-snapshot
Diophantine Approximation in Finite Characteristic
inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_4openalex-snapshot
Abstract Numeration Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-22321-1_15openalex-snapshot
Enumeration and Decidable Properties of Automatic Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-27654-5_9openalex-snapshot
Hartmanis-Stearns Conjecture on Real Time and Transcendence
inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_266-5openalex-snapshot
Growth Phenomena in Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-28332-1_42openalex-snapshot
k-Automatic Sets of Rational Numbers
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_27openalex-snapshot
On the Number of Unbordered Factors
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_28openalex-snapshot
Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-38536-0_5openalex-snapshot
Decidability and Enumeration for Automatic Sequences: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-38771-5_23openalex-snapshot
Subword Complexity and k-Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-642-40579-2_23openalex-snapshot
Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words
inferred← citeshttps://doi.org/10.1007/978-3-642-56755-1_18openalex-snapshot
Irreducible Polynomials Generated by Decimations
inferred← citeshttps://doi.org/10.1007/978-3-642-61324-1_10openalex-snapshot
Spectral Studies of Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-75405-0_19openalex-snapshot
Summation Formulae for Substitutions on a Finite Alphabet
inferred← citeshttps://doi.org/10.1007/978-3-662-03130-8_11openalex-snapshot
Automata and automatic sequences
inferred← citeshttps://doi.org/10.1007/978-3-662-03130-8_12openalex-snapshot
Spectral study of automatic and substitutive sequences
inferred← citeshttps://doi.org/10.1007/978-94-010-0345-2_3openalex-snapshot
Combinatorial and Dynamical Study of Substitutions Around the Theorem of Cobham
inferred← citeshttps://doi.org/10.1007/978-94-011-1691-6_1openalex-snapshot
Complexity of Infinite Sequences and the Ising Transducer
inferred← citeshttps://doi.org/10.1007/978-94-015-9153-9_13openalex-snapshot
Cellular Automata, Finite Automata, and Number Theory
inferred← citeshttps://doi.org/10.1007/bf00289415openalex-snapshot
Hi�rarchie et fermeture de certaines classes de tag-syst�mes
inferred← citeshttps://doi.org/10.1007/bf01010446openalex-snapshot
Quasicrystal Ising chain and automata theory
inferred← citeshttps://doi.org/10.1007/bf01213862openalex-snapshot
A result about languages concerning paperfolding sequences
inferred← citeshttps://doi.org/10.1007/bf01258057openalex-snapshot
Automatische Folgen und Transzendenz in positiver Charakteristik
inferred← citeshttps://doi.org/10.1007/bf02181049openalex-snapshot
Suites de toeplitz,p-pliage, suites automatiques et polynomes
inferred← citeshttps://doi.org/10.1007/bf02588048openalex-snapshot
On the complexity of algebraic numbers, II. Continued fractions
inferred← citeshttps://doi.org/10.1007/bf02679463openalex-snapshot
Automatic Maps in Exotic Numeration Systems
inferred← citeshttps://doi.org/10.1007/bf02773640openalex-snapshot
Measure-theoretic complexity of ergodic systems
inferred← citeshttps://doi.org/10.1007/bf02835535openalex-snapshot
The structure of invertible substitutions on a three-letter alphabet
inferred← citeshttps://doi.org/10.1007/bfb0012769openalex-snapshot
Repetitions in homomorphisms and languages
inferred← citeshttps://doi.org/10.1007/bfb0015766openalex-snapshot
Applications of an infinite squarefree CO-CFL
inferred← citeshttps://doi.org/10.1007/bfb0017307openalex-snapshot
A decidable property of iterated morphisms
inferred← citeshttps://doi.org/10.1007/bfb0023813openalex-snapshot
q-Regular sequences and other generalizations of q-automatic sequences
inferred← citeshttps://doi.org/10.1007/bfb0026598openalex-snapshot
Inverse problems for finite automata: A solution based on genetic algorithms
inferred← citeshttps://doi.org/10.1007/bfb0028971openalex-snapshot
Properties of infinite words : Recent results
inferred← citeshttps://doi.org/10.1007/bfb0028981openalex-snapshot
A generalization of automatic sequences
inferred← citeshttps://doi.org/10.1007/bfb0030303openalex-snapshot
On generalized words of Thue-Morse
inferred← citeshttps://doi.org/10.1007/s00026-003-0180-4openalex-snapshot
A Semigroup Approach to Automaticity
inferred← citeshttps://doi.org/10.1007/s00145-015-9206-4openalex-snapshot
New Second-Preimage Attacks on Hash Functions
inferred← citeshttps://doi.org/10.1007/s00209-021-02834-3openalex-snapshot
Multiplicative automatic sequences
inferred← citeshttps://doi.org/10.1007/s00224-025-10214-1openalex-snapshot
Rudin-Shapiro Sums Via Automata Theory and Logic
inferred← citeshttps://doi.org/10.1007/s002240000084openalex-snapshot
A Generalization of Cobham's Theorem
inferred← citeshttps://doi.org/10.1007/s002240010014openalex-snapshot
Numeration Systems on a Regular Language
inferred← citeshttps://doi.org/10.1007/s00236-026-00521-6openalex-snapshot
Opacity complexity of automatic sequences: the general case
inferred← citeshttps://doi.org/10.1007/s00454-008-9108-4openalex-snapshot
Self-Similar Tiling Systems, Topological Factors and Stretching Factors
inferred← citeshttps://doi.org/10.1007/s00493-020-4311-xopenalex-snapshot
Substitutive Systems and a Finitary Version of Cobham’s Theorem
inferred← citeshttps://doi.org/10.1007/s00605-008-0006-xopenalex-snapshot
Cubic Pisot unit combinatorial games
inferred← citeshttps://doi.org/10.1007/s11139-023-00710-8openalex-snapshot
On k-regularity of sequences of valuations and last non-zero digits
inferred← citeshttps://doi.org/10.1007/s11511-009-0040-0openalex-snapshot
La somme des chiffres des carrés
inferred← citeshttps://doi.org/10.1007/s11854-022-0226-3openalex-snapshot
Deterministic functions on amenable semigroups and a generalization of the Kamae-Weiss theorem on normality preservation
inferred← citeshttps://doi.org/10.1007/s11856-025-2755-9openalex-snapshot
Synchronizing automatic sequences along Piatetski-Shapiro sequences
inferred← citeshttps://doi.org/10.1007/s12044-017-0333-8openalex-snapshot
p-Adic valuation of the Morgan–Voyce sequence and p-regularity
inferred← citeshttps://doi.org/10.1016/0012-365x(80)90151-xopenalex-snapshot
Mots sans carre et morphismes iteres
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90254-2openalex-snapshot
Iteration of maps by an automaton
inferred← citeshttps://doi.org/10.1016/0020-0190(78)90074-1openalex-snapshot
Tag systems generating thue irreductible sequences
inferred← citeshttps://doi.org/10.1016/0020-0190(81)90004-1openalex-snapshot
The morse sequence and iterated morphisms
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90073-0openalex-snapshot
An infinite square-free co-CFL
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00074-mopenalex-snapshot
Subword complexity of a generalized Thue-Morse word
inferred← citeshttps://doi.org/10.1016/0022-314x(88)90103-5openalex-snapshot
Sur l'ensemble normal des substitutions de longueur quelconque
inferred← citeshttps://doi.org/10.1016/0022-314x(91)90054-fopenalex-snapshot
Digital sum problems and substitutions on a finite alphabet
inferred← citeshttps://doi.org/10.1016/0022-4049(95)00043-7openalex-snapshot
Special factors of automatic sequences
inferred← citeshttps://doi.org/10.1016/0166-218x(84)90129-xopenalex-snapshot
On regularity of languages generated by copying systems
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00132-wopenalex-snapshot
Linear cellular automata, finite automata and Pascal's triangle
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90103-xopenalex-snapshot
A generalization of automatic sequences
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90037-6openalex-snapshot
On a sequence of rational functions
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90039-xopenalex-snapshot
On a possible classification of real-time constructed sequences
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90041-8openalex-snapshot
Systemes de numeration et fonctions fractales relatifs aux substitutions
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90046-7openalex-snapshot
Infinite words with linear subword complexity
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90172-xopenalex-snapshot
On the number of factors of Sturmian words
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90001-vopenalex-snapshot
The ring of k-regular sequences
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90032-bopenalex-snapshot
Pattern spectra, substring enumeration, and automatic sequences
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90045-hopenalex-snapshot
Some studies on the (p, q)-type sequences
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90028-0openalex-snapshot
Canonical positions for the factors in paperfolding sequences
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90064-7openalex-snapshot
Note on the cyclic towers of Hanoi
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00008-9openalex-snapshot
About the p-paperfolding words
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00234-0openalex-snapshot
On the vector space of the automatic reals
inferred← citeshttps://doi.org/10.1016/0304-3975(95)91132-aopenalex-snapshot
Substitutions et β-systèmes de numération
inferred← citeshttps://doi.org/10.1016/b978-044451627-5/50002-xopenalex-snapshot
Periodic and Quasiperiodic Structures
inferred← citeshttps://doi.org/10.1016/j.aam.2008.02.001openalex-snapshot
Syndeticity and independent substitutions
inferred← citeshttps://doi.org/10.1016/j.aam.2011.03.005openalex-snapshot
Some improvements of the S-adic conjecture
inferred← citeshttps://doi.org/10.1016/j.aam.2014.10.002openalex-snapshot
A characterization of p-automatic sequences as columns of linear cellular automata
inferred← citeshttps://doi.org/10.1016/j.aam.2016.11.002openalex-snapshot
Subword complexity and non-automaticity of certain completely multiplicative functions
inferred← citeshttps://doi.org/10.1016/j.aam.2018.12.001openalex-snapshot
On the regularity of the Hankel determinant sequence of the characteristic sequence of powers of 2
inferred← citeshttps://doi.org/10.1016/j.aam.2019.03.003openalex-snapshot
Automatic sequences based on Parry or Bertrand numeration systems
inferred← citeshttps://doi.org/10.1016/j.aam.2024.102834openalex-snapshot
Letter frequency vs factor frequency in pure morphic words
inferred← citeshttps://doi.org/10.1016/j.aam.2025.102869openalex-snapshot
Automatic sequences and parity of partition functions
inferred← citeshttps://doi.org/10.1016/j.chaos.2017.04.018openalex-snapshot
Morphisms on infinite alphabets, countable states automata and regular sequences
inferred← citeshttps://doi.org/10.1016/j.cpc.2019.03.015openalex-snapshot
An algorithm for periodicity and almost periodicity of uniform substitution sequences and its implications on aperiodic spin models
inferred← citeshttps://doi.org/10.1016/j.crma.2004.04.012openalex-snapshot
Sur la complexité des nombres algébriques
inferred← citeshttps://doi.org/10.1016/j.crma.2008.06.013openalex-snapshot
On the triplex substitution – combinatorial properties
inferred← citeshttps://doi.org/10.1016/j.disc.2004.05.004openalex-snapshot
Decidability questions related to abstract numeration systems
inferred← citeshttps://doi.org/10.1016/j.disc.2006.08.001openalex-snapshot
On a sequence related to that of Thue–Morse and its applications
inferred← citeshttps://doi.org/10.1016/j.disc.2009.12.002openalex-snapshot
Multidimensional generalized automatic sequences and shape-symmetric morphic words
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114399openalex-snapshot
On a family of automatic apwenian sequences
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114685openalex-snapshot
The characteristic sequence of the integers that are the sum of two squares is not morphic
inferred← citeshttps://doi.org/10.1016/j.ejc.2005.07.019openalex-snapshot
The origins of combinatorics on words
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.07.004openalex-snapshot
Fp -affine recurrent n -dimensional sequences over Fq are p -automatic
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.02.030openalex-snapshot
On the regular sum-free sets
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103475openalex-snapshot
Regular sequences and synchronized sequences in abstract numeration systems
inferred← citeshttps://doi.org/10.1016/j.ejc.2025.104282openalex-snapshot
Quasi-fixed points of substitutive systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.021openalex-snapshot
Linearization of Automatic Arrays and Weave Specifications
inferred← citeshttps://doi.org/10.1016/j.exmath.2021.08.001openalex-snapshot
How to prove that a sequence is not automatic
inferred← citeshttps://doi.org/10.1016/j.ffa.2016.03.002openalex-snapshot
Hyperquadratic continued fractions and automatic sequences
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104710openalex-snapshot
Complexity of automatic sequences
inferred← citeshttps://doi.org/10.1016/j.indag.2023.05.003openalex-snapshot
Semicocycle discontinuities for substitutions and reverse-reading automata
inferred← citeshttps://doi.org/10.1016/j.indag.2025.04.001openalex-snapshot
A graph-theoretic proof of Cobham’s Dichotomy for automatic sequences
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.11.012openalex-snapshot
Direct definition of a ternary infinite square-free sequence
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2016.12.028openalex-snapshot
On certain recurrent and automatic sequences in finite fields
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2022.03.019openalex-snapshot
Automata and finite order elements in the Nottingham group
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2025.01.004openalex-snapshot
On the finite factorial numbers
inferred← citeshttps://doi.org/10.1016/j.jcta.2009.07.010openalex-snapshot
Extensions and restrictions of Wythoff's game preserving its P positions
inferred← citeshttps://doi.org/10.1016/j.jnt.2012.03.006openalex-snapshot
Subsequences of automatic sequences indexed by ⌊nc⌋ and correlations
inferred← citeshttps://doi.org/10.1016/j.jnt.2016.11.004openalex-snapshot
Criteria for regularity of Mahler power series and Becker's conjecture
inferred← citeshttps://doi.org/10.1016/j.jnt.2017.10.029openalex-snapshot
Transcendence of L(1,χ)/Π and automata
inferred← citeshttps://doi.org/10.1016/j.jnt.2019.12.015openalex-snapshot
On completely multiplicative automatic sequences
inferred← citeshttps://doi.org/10.1016/j.laa.2016.02.030openalex-snapshot
Asymptotic properties of free monoid morphisms
inferred← citeshttps://doi.org/10.1016/j.optmat.2017.07.029openalex-snapshot
Thermal radiation in one-dimensional photonic quasicrystals with graphene
inferred← citeshttps://doi.org/10.1016/j.physrep.2013.10.004openalex-snapshot
DNA-based nanobiostructured devices: The role of quasiperiodicity and correlation effects
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.040openalex-snapshot
Entropy rates and finite-state dimension
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.11.013openalex-snapshot
About frequencies of letters in generalized automatic sequences
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.10.015openalex-snapshot
On the subword complexity of Thue–Morse polynomial extractions
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.10.027openalex-snapshot
Cobham–Semenov theorem and Nd -subshifts
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.05.015openalex-snapshot
On complexity functions of infinite words associated with generalized Dyck languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.08.005openalex-snapshot
On factors of synchronized sequences
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.09.022openalex-snapshot
On the complexity of a family of k -context-free sequences
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.002openalex-snapshot
A two-valued recurrent double sequence that is not automatic
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.08.001openalex-snapshot
Automaticity of the Hankel determinants of difference sequences of the Thue–Morse sequence
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.025openalex-snapshot
Another generalization of abelian equivalence: Binomial complexity of infinite words
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.023openalex-snapshot
The signature of rational languages
showing the first 200 of 411 · page through all 411
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.