On the public citation graph
An Eilenberg theorem for words on countable ordinals
0 signed · 40 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/3-540-16078-7_75openalex-snapshot
Varietes de Semis Groupes et Mots Infinis
inferredcites →https://doi.org/10.1007/3-540-16761-7_79openalex-snapshot
Etude syntaxique des parties reconnaissables de mots infinis
inferredcites →https://doi.org/10.1007/3-540-54233-7_166openalex-snapshot
An EILENBERG theorem for ∞-languages
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_23openalex-snapshot
On a Decision Method in Restricted Second Order Arithmetic
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_24openalex-snapshot
Transfinite Automata Recursions and Weak Second Order Theory of Ordinals
inferredcites →https://doi.org/10.1007/978-94-011-0149-3_3openalex-snapshot
Semigroups and Automata on Infinite Words
inferredcites →https://doi.org/10.1007/bfb0030294openalex-snapshot
Recent results on automata and infinite words
inferredcites →https://doi.org/10.1007/bfb0036941openalex-snapshot
Varietes de semigroupes et mots infinis
inferredcites →https://doi.org/10.1016/0022-0000(78)90036-3openalex-snapshot
Finite automata, definable sets, and regular expressions over ωn-tapes
inferredcites →https://doi.org/10.1016/0304-3975(85)90148-3openalex-snapshot
A syntactic congruence for rational ω-languages
inferredcites →https://doi.org/10.1016/s0019-9958(65)90108-7openalex-snapshot
On finite monoids having only trivial subgroups
inferredcites →https://doi.org/10.1109/sfcs.1996.548484openalex-snapshot
Temporal logic and semidirect products: an effective characterization of the until hierarchy
inferredcites →https://doi.org/10.1137/s0097539797322772openalex-snapshot
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy
inferredcites →https://doi.org/10.1142/s0218196798000028openalex-snapshot
Automata, Semigroups and Recognizability of Words on Ordinals
inferredcites →https://doi.org/10.3233/fi-1985-83-407openalex-snapshot
Finite Automata on Transfinite Sequences and Regular Expressions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2000.3009openalex-snapshot
Star-Free Sets of Words on Ordinals
inferred← citeshttps://doi.org/10.1006/jcss.2001.1782openalex-snapshot
Logic over Words on Denumerable Ordinals
inferred← citeshttps://doi.org/10.1007/11505877_12openalex-snapshot
Schützenberger and Eilenberg Theorems for Words on Linear Orderings
inferred← citeshttps://doi.org/10.1007/3-540-44669-9_25openalex-snapshot
How Powerful Are Infinite Time Machines?
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_21openalex-snapshot
Automata on Linear Orderings
inferred← citeshttps://doi.org/10.1007/3-540-46011-x_2openalex-snapshot
Elementary Theory of Ordinals with Addition and Left Translation by ω
inferred← citeshttps://doi.org/10.1007/978-3-030-48516-0_1openalex-snapshot
Equational Theories of Scattered and Countable Series-Parallel Posets
inferred← citeshttps://doi.org/10.1007/978-3-030-99253-8_14openalex-snapshot
First-order separation over countable ordinals
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_33openalex-snapshot
Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank
inferred← citeshttps://doi.org/10.1007/978-3-540-30550-7_32openalex-snapshot
Complementation of Rational Sets on Countable Scattered Linear Orderings
inferred← citeshttps://doi.org/10.1007/s00224-005-1129-2openalex-snapshot
Hierarchy Among Automata on Linear Orderings
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.10.009openalex-snapshot
Automata on linear orderings
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.06.003openalex-snapshot
Schützenberger and Eilenberg theorems for words on linear orderings
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.10.013openalex-snapshot
Factorization forests for infinite words and applications to countable scattered linear orderings
inferred← citeshttps://doi.org/10.1051/ita:2004005openalex-snapshot
Axiomatizing omega and omega-op powers of words
inferred← citeshttps://doi.org/10.1134/s003294601302004xopenalex-snapshot
Determinization of ordinal automata
inferred← citeshttps://doi.org/10.1142/s0129054105003285openalex-snapshot
COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS
inferred← citeshttps://doi.org/10.1142/s021819670000025xopenalex-snapshot
TRANSFINITE EQUATIONS IN TRANSFINITE STRINGS
inferred← citeshttps://doi.org/10.2178/jsl/1327068708openalex-snapshot
A hierarchy of tree-automatic structures
inferred← citeshttps://doi.org/10.70675/7e081343zc4b1z447dz8d2dze666dd284afdopenalex-snapshot
Posets série-parallèles transfinis : automates, logiques et théories équationnelles
inferred← citeshttps://doi.org/10.7146/brics.v9i41.21756openalex-snapshot
Axiomatizing Omega and Omega-op Powers of Words
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.