On the public citation graph
Recognizable and rational languages of finite and infinite traces
0 signed · 37 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-16761-7_75openalex-snapshot
On recognizable subsets of free partially commutative monoids
inferredcites →https://doi.org/10.1007/3-540-51237-3_22openalex-snapshot
Safe executions of recognizable trace languages by asynchronous automata
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/bfb0027043openalex-snapshot
Infinitary languages: Basic theory and applications to concurrent systems
inferredcites →https://doi.org/10.1007/bfb0079468openalex-snapshot
Problèmes combinatoires de commutation et réarrangements
inferredcites →https://doi.org/10.1016/0304-3975(85)90013-1openalex-snapshot
Recognizable subsets of some partially abelian monoids
inferredcites →https://doi.org/10.1016/0304-3975(85)90148-3openalex-snapshot
A syntactic congruence for rational ω-languages
inferredcites →https://doi.org/10.1016/0304-3975(85)90206-3openalex-snapshot
Maximal serializability of iterated transactions
inferredcites →https://doi.org/10.1016/0304-3975(87)90080-6openalex-snapshot
On regular trace languages
inferredcites →https://doi.org/10.1016/0304-3975(88)90027-8openalex-snapshot
On recognizable subsets of free partially commutative monoids
inferredcites →https://doi.org/10.1016/0304-3975(90)90134-4openalex-snapshot
Un modèle asynchrone pour les systèmes distribués
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1051/ita/1985190100211openalex-snapshot
Automates et commutations partielles
inferredcites →https://doi.org/10.1051/ita/1986200201211openalex-snapshot
Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
inferredcites →https://doi.org/10.1051/ita/1987210200991openalex-snapshot
Notes on finite asynchronous automata
inferredcites →https://doi.org/10.1109/swct.1963.8openalex-snapshot
Infinite sequences and finite machines
inferredcites →https://doi.org/10.55248/gengpi.5.0924.2640openalex-snapshot
RAIRO -Theoretical Informatics and Applications
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-54233-7_139openalex-snapshot
A Kleene theorem for infinite trace languages
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_56openalex-snapshot
Recognizable complex trace languages (abstract)
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_179openalex-snapshot
A survey of recognizable languages of infinite traces
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_106openalex-snapshot
Asynchronous cellular automata for infinite traces
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_64openalex-snapshot
On the complementation of Büchi asynchronous cellular automata
inferred← citeshttps://doi.org/10.1007/978-3-031-08143-9_8openalex-snapshot
Formal Choreographic Languages
inferred← citeshttps://doi.org/10.1007/978-3-032-04700-7_24openalex-snapshot
Disjointness, Inclusion, and Regularity of $$\omega $$-Rational Trace Languages – Extended Abstract –
inferred← citeshttps://doi.org/10.1007/bf01178512openalex-snapshot
Deterministic asynchronous automata for infinite traces
inferred← citeshttps://doi.org/10.1007/bf01200264openalex-snapshot
Recognizable trace languages, distributed automata and the distribution problem
inferred← citeshttps://doi.org/10.1007/s10958-006-0120-zopenalex-snapshot
On infinite real trace rational languages of maximum topological complexity
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)90254-2openalex-snapshot
An extension of Kleene's and Ochmański's theorems to infinite traces
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.030openalex-snapshot
Agreeing within a few writes
inferred← citeshttps://doi.org/10.46298/lmcs-19(3:9)2023openalex-snapshot
A Theory of Formal Choreographic Languages
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.