On the public citation graph
Properties of infinite words : Recent results
0 signed · 46 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.1007/978-1-4612-3352-7_22openalex-snapshot
Sequences Defined by Iterated Morphisms
inferredcites →https://doi.org/10.1007/bf01229319openalex-snapshot
A permutational property of groups
inferredcites →https://doi.org/10.1007/bf02573241openalex-snapshot
Permutation properties and the fibonacci semigroup
inferredcites →https://doi.org/10.1007/bf02573248openalex-snapshot
Infinite words and permutation properties
inferredcites →https://doi.org/10.1007/bfb0015766openalex-snapshot
Applications of an infinite squarefree CO-CFL
inferredcites →https://doi.org/10.1016/0020-0190(81)90121-6openalex-snapshot
On the subword complexity of DOL languages with a constant distribution
inferredcites →https://doi.org/10.1016/0020-0190(85)90073-0openalex-snapshot
An infinite square-free co-CFL
inferredcites →https://doi.org/10.1016/0020-0190(86)90034-7openalex-snapshot
Every iterated morphism yields a co-CFL
inferredcites →https://doi.org/10.1016/0020-0190(87)90098-6openalex-snapshot
An infinite word language which is not co-CFL
inferredcites →https://doi.org/10.1016/0020-0190(87)90162-1openalex-snapshot
Prefixes of infinite words and ambiguous context-free languages
inferredcites →https://doi.org/10.1016/0020-0190(89)90228-7openalex-snapshot
Factorial languages whose growth function is quadratically upper bounded
inferredcites →https://doi.org/10.1016/0021-8693(84)90237-0openalex-snapshot
On the burnside problem for semigroups
inferredcites →https://doi.org/10.1016/0021-8693(88)90088-9openalex-snapshot
Rewriting products of group elements—II
inferredcites →https://doi.org/10.1016/0021-8693(88)90233-5openalex-snapshot
Rewriting products of group elements—I
inferredcites →https://doi.org/10.1016/0166-218x(83)90002-1openalex-snapshot
On cube-free ω-words generated by binary morphisms
inferredcites →https://doi.org/10.1016/0166-218x(92)90274-eopenalex-snapshot
Enumeration of factors in the Thue-Morse word
inferredcites →https://doi.org/10.1016/0304-3975(82)90013-5openalex-snapshot
On infinite words obtained by iterating morphisms
inferredcites →https://doi.org/10.1016/0304-3975(87)90011-9openalex-snapshot
Analytic models and ambiguity of context-free languages
inferredcites →https://doi.org/10.1016/0304-3975(88)90103-xopenalex-snapshot
A generalization of automatic sequences
inferredcites →https://doi.org/10.1016/0304-3975(89)90013-3openalex-snapshot
Some combinatorial properties of the Thue–Morse sequence and a problem in semigroups
inferredcites →https://doi.org/10.1016/0304-3975(89)90046-7openalex-snapshot
Infinite words with linear subword complexity
inferredcites →https://doi.org/10.1051/ita/1979130403631openalex-snapshot
Quelques problèmes ouverts en théorie des langages algébriques
inferredcites →https://doi.org/10.1051/ita/1986200100431openalex-snapshot
Decidability of periodicity for infinite words
inferredcites →https://doi.org/10.1051/ita/1986200100471openalex-snapshot
On the periodicity of morphisms on free monoids
inferredcites →https://doi.org/10.1051/ita/1987210201371openalex-snapshot
Sur les centres de DOL-langages
inferredcites →https://doi.org/10.1090/s0002-9904-1969-12256-1openalex-snapshot
Book Review: Noncommutative rings
inferredcites →https://doi.org/10.1137/0214031openalex-snapshot
An “Interchange Lemma” for Context-Free Languages
inferredcites →https://doi.org/10.1145/321312.321318openalex-snapshot
Ambiguity in context free languages
inferredcites →https://doi.org/10.1145/322307.322315openalex-snapshot
A Generalization of Ogden's Lemma
inferredcites →https://doi.org/10.1215/s0012-7094-44-01101-4openalex-snapshot
Unending chess, symbolic dynamics and a problem in semigroups
inferredcites →https://doi.org/10.2307/2371431openalex-snapshot
Symbolic Dynamics II. Sturmian Trajectories
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_210openalex-snapshot
Iterative devices generating infinite words
inferred← citeshttps://doi.org/10.1007/978-3-642-40579-2_25openalex-snapshot
On Infinite Words Determined by L Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-59136-5_9openalex-snapshot
Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_43openalex-snapshot
On Infinite Words Determined by Indexed Languages
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00162-6openalex-snapshot
On repeated factors in C∞-words
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50007-xopenalex-snapshot
Context-Free Languages
inferred← citeshttps://doi.org/10.1016/j.ic.2016.11.002openalex-snapshot
A new pumping lemma for indexed languages, with an application to infinite words
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.05.049openalex-snapshot
On infinite words determined by L systems
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2013.413openalex-snapshot
On Infinite Words Determined by Stack Automata
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.