On the public citation graph
Recent results on automata and infinite words
0 signed · 74 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/bfb0036493openalex-snapshot
A hierarchy of sets of infinite trees
inferredcites →https://doi.org/10.1016/0020-0190(82)90097-7openalex-snapshot
Determinancy of sinking automata on infinite trees and inequalities between various Rabin's pair indices
inferredcites →https://doi.org/10.1016/0304-3975(83)90086-5openalex-snapshot
Rational Ω-languages are non-ambiguous
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(66)80013-xopenalex-snapshot
Testing and generating infinite sequences by a finite automaton
inferredcites →https://doi.org/10.1016/s0019-9958(79)90629-6openalex-snapshot
Star-free regular sets of ω-sequences
inferredcites →https://doi.org/10.1016/s0019-9958(81)90663-xopenalex-snapshot
A combinatorial approach to the theory of ω-automata
inferredcites →https://doi.org/10.1145/800070.802176openalex-snapshot
Ensembles reconnaissables de mots biinfinis
inferredcites →https://doi.org/10.2307/2183047openalex-snapshot
Logic, Methodology and Philosophy of Science.
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-15641-0_21openalex-snapshot
Ensembles reconnaissables de mots bi-inpinis Limite et déterminisme
inferred← citeshttps://doi.org/10.1007/3-540-15641-0_23openalex-snapshot
Star-free ω-languages and first order logic
inferred← citeshttps://doi.org/10.1007/3-540-16078-7_75openalex-snapshot
Varietes de Semis Groupes et Mots Infinis
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_79openalex-snapshot
Etude syntaxique des parties reconnaissables de mots infinis
inferred← citeshttps://doi.org/10.1007/3-540-18740-5_97openalex-snapshot
Complexity gaps of Turing machines on infinite words
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-51486-4_91openalex-snapshot
Pushdown automata on infinite trees and omega-Kleene closure of context-free tree sets
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_139openalex-snapshot
A Kleene theorem for infinite trace languages
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_166openalex-snapshot
An EILENBERG theorem for ∞-languages
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_18openalex-snapshot
Rabin tree automata and finite monoids
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-030-99253-8_8openalex-snapshot
On the Translation of Automata to Linear Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-05578-2_18openalex-snapshot
Weighted Tree Automata with Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-52113-3_30openalex-snapshot
The Weighted HOM-Problem Over Fields
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_27openalex-snapshot
Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_37openalex-snapshot
Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/978-3-540-75292-9_32openalex-snapshot
On the Expressive Power of QLTL
inferred← citeshttps://doi.org/10.1007/978-3-540-79709-8_11openalex-snapshot
Logic and Rational Languages of Words Indexed by Linear Orderings
inferred← citeshttps://doi.org/10.1007/978-3-642-28729-9_9openalex-snapshot
Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-30642-6_10openalex-snapshot
Bounded Synchronization Delay in Omega-Rational Expressions
inferred← citeshttps://doi.org/10.1007/978-3-662-49630-5_14openalex-snapshot
Quantifier Alternation for Infinite Words
inferred← citeshttps://doi.org/10.1007/978-94-011-0149-3_3openalex-snapshot
Semigroups and Automata on Infinite Words
inferred← citeshttps://doi.org/10.1007/bf02127803openalex-snapshot
Logic, semigroups and automata on words
inferred← citeshttps://doi.org/10.1007/bfb0013041openalex-snapshot
Computation tree logic and regular ω-languages
inferred← citeshttps://doi.org/10.1007/bfb0017489openalex-snapshot
On projective and separable properties
inferred← citeshttps://doi.org/10.1007/bfb0027043openalex-snapshot
Infinitary languages: Basic theory and applications to concurrent systems
inferred← citeshttps://doi.org/10.1007/bfb0029602openalex-snapshot
Interrogative complexity of ω-languages’ recognition
inferred← citeshttps://doi.org/10.1007/bfb0039621openalex-snapshot
Some results on fairness: The regular case
inferred← citeshttps://doi.org/10.1007/bfb0054310openalex-snapshot
An Eilenberg theorem for words on countable ordinals
inferred← citeshttps://doi.org/10.1007/bfb0054312openalex-snapshot
Positive varieties and infinite words
inferred← citeshttps://doi.org/10.1007/s00224-009-9222-6openalex-snapshot
Logic and Rational Languages of Words Indexed by Linear Orderings
inferred← citeshttps://doi.org/10.1007/s00224-013-9526-4openalex-snapshot
Omega-Rational Expressions with Bounded Synchronization Delay
inferred← citeshttps://doi.org/10.1007/s00224-023-10144-wopenalex-snapshot
Weighted Tree Automata with Constraints
inferred← citeshttps://doi.org/10.1007/s00236-005-0164-4openalex-snapshot
The stuttering principle revisited
inferred← citeshttps://doi.org/10.1007/s10773-018-3983-0openalex-snapshot
Quantum ω-Automata over Infinite Words and Their Relationships
inferred← citeshttps://doi.org/10.1016/0022-0000(86)90037-1openalex-snapshot
First-order logic and star-free sets
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90126-5openalex-snapshot
An introduction to the regular theory of fairness
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90281-6openalex-snapshot
On the expressive power of temporal logic for infinite words
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90006-2openalex-snapshot
Varieties of finite monoids and Büchi-McNaughton theorem
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90247-qopenalex-snapshot
The poset of infinitary traces
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90275-5openalex-snapshot
Rabin tree automata and finite monoids
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00130-1openalex-snapshot
Logical definability on infinite traces
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferred← citeshttps://doi.org/10.1016/j.ic.2006.07.002openalex-snapshot
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
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.jcss.2024.103616openalex-snapshot
The weighted HOM-problem over fields
inferred← citeshttps://doi.org/10.1016/s0022-4049(99)00093-6openalex-snapshot
Wreath product and infinite words
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00370-5openalex-snapshot
Towards a language theory for infinite N-free pomsets
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00225-3openalex-snapshot
On projective and separable properties
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470738openalex-snapshot
SD-Regular Transducer Expressions for Aperiodic Transformations
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548484openalex-snapshot
Temporal logic and semidirect products: an effective characterization of the until hierarchy
inferred← citeshttps://doi.org/10.1142/s021819671750028xopenalex-snapshot
Characterizing classes of regular languages using prefix codes of bounded synchronization delay
inferred← citeshttps://doi.org/10.2168/lmcs-12(1:5)2016openalex-snapshot
Separating Regular Languages with First-Order Logic
inferred← citeshttps://doi.org/10.4204/eptcs.386.16openalex-snapshot
Solving the Weighted HOM-Problem With the Help of Unambiguity
inferred← citeshttps://doi.org/10.70675/103d5ffaz8ac1z4734z8baez06115519a946openalex-snapshot
Définissabilité et synthèse de transductions
inferred← citeshttps://doi.org/10.70675/22dd7305zb552z431fza392zbc8e233f69dfopenalex-snapshot
Induction Schemes : From Language Separation to Graph Colorings
inferred← citeshttps://doi.org/10.70675/7e081343zc4b1z447dz8d2dze666dd284afdopenalex-snapshot
Posets série-parallèles transfinis : automates, logiques et théories équationnelles
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.