On the public citation graph
Infinitary languages: Basic theory and applications to concurrent systems
0 signed · 66 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/zamm.19790591043openalex-snapshot
Lindner, R./Staiger, L., Algebraische Codierungstheorie, Theorie der sequentiellen Codierungen. Berlin, Akademie‐Verlag 1977. 268 S., M 48,–
inferredcites →https://doi.org/10.1007/3-540-10843-2_22openalex-snapshot
Impartiality, justice and fairness: The ethics of concurrent termination
inferredcites →https://doi.org/10.1007/3-540-15204-0_6openalex-snapshot
Infinite behaviour and fairness in petri nets
inferredcites →https://doi.org/10.1007/bf01792729openalex-snapshot
Theorie der endlichen und unendlichen Graphen
inferredcites →https://doi.org/10.1007/bf02575909openalex-snapshot
Relations rationnelles infinitaires
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0030294openalex-snapshot
Recent results on automata and infinite words
inferredcites →https://doi.org/10.1007/bfb0036895openalex-snapshot
Topological characterizations of infinite behaviours of transition systems
inferredcites →https://doi.org/10.1016/0304-3975(79)90042-2openalex-snapshot
Language operators related to Init
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(83)90057-9openalex-snapshot
A note on ω-regular languages
inferredcites →https://doi.org/10.1016/0304-3975(83)90115-9openalex-snapshot
Infinite behaviour of Petri nets
inferredcites →https://doi.org/10.1016/0304-3975(84)90095-1openalex-snapshot
Bilimites de langages reconnaissables
inferredcites →https://doi.org/10.1016/0304-3975(84)90131-2openalex-snapshot
Adherences of D0L 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/s0022-0000(74)80051-6openalex-snapshot
Theories of automata on ω-tapes: A simplified approach
inferredcites →https://doi.org/10.1016/s0022-0000(77)80004-4openalex-snapshot
Theory of ω-languagesI: Characterizations of ω-context-free languages
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1051/ita/1978120302591openalex-snapshot
Sur les ensembles de mots infinis engendrés par une grammaire algébrique
inferredcites →https://doi.org/10.1090/s0002-9947-1921-1501161-8openalex-snapshot
Recurrent Geodesics on a Surface of Negative Curvature
inferredcites →https://doi.org/10.1109/swct.1963.8openalex-snapshot
Infinite sequences and finite machines
inferredcites →https://doi.org/10.1145/800070.802176openalex-snapshot
Ensembles reconnaissables de mots biinfinis
inferredcites →https://doi.org/10.2307/2314883openalex-snapshot
Sets of Numbers Defined by Finite Automata
inferredcites →https://doi.org/10.4169/000298910x484726openalex-snapshot
American Mathematical Monthly
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-50580-6_31openalex-snapshot
Infinitary partial Petri net languages and their relationship to other Petri net semantics
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_42openalex-snapshot
Kolmogorov complexity and Hausdorff dimension
inferred← citeshttps://doi.org/10.1007/3-540-51734-0_58openalex-snapshot
Learning ω-regular languages from queries and counter-examples (a preliminary report)
inferred← citeshttps://doi.org/10.1007/3-540-52753-2_50openalex-snapshot
Semantic for abstract fairness using metric spaces
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-56503-5_58openalex-snapshot
On syntactic congruences for ω—languages
inferred← citeshttps://doi.org/10.1007/978-3-642-15240-5_20openalex-snapshot
Topologies Refining the Cantor Topology on X ω
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_7openalex-snapshot
Languages, Automata, and Logic
inferred← citeshttps://doi.org/10.1007/bf02366857openalex-snapshot
Extension of the automaton specification logical language and the synthesis problem
inferred← citeshttps://doi.org/10.1007/bfb0013041openalex-snapshot
Computation tree logic and regular ω-languages
inferred← citeshttps://doi.org/10.1007/bfb0013115openalex-snapshot
Automata and quantifier hierarchies
inferred← citeshttps://doi.org/10.1007/bfb0020790openalex-snapshot
Recognizable and rational languages of finite and infinite traces
inferred← citeshttps://doi.org/10.1007/bfb0020791openalex-snapshot
On the concatenation of infinite traces
inferred← citeshttps://doi.org/10.1016/0020-0255(93)90031-gopenalex-snapshot
On deciding trace equivalences for processes
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90011-kopenalex-snapshot
Matrix and matricial iteration theories, Part II
inferred← citeshttps://doi.org/10.1016/0164-1212(96)00026-xopenalex-snapshot
Verification and behavior abstraction towards a tractable verification technique for large distributed systems
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90331-9openalex-snapshot
On automata on infinite trees
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90209-copenalex-snapshot
On the concatenation of infinite traces
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90247-qopenalex-snapshot
The poset of infinitary 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.ipl.2006.08.014openalex-snapshot
A power-set construction for reducing Büchi automata to non-determinism degree two
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.10.003openalex-snapshot
Shift-invariant topologies for the Cantor space X
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00157-0openalex-snapshot
Set constraints and topology
inferred← citeshttps://doi.org/10.1016/s0164-1212(97)00169-6openalex-snapshot
Application of formal verification and behaviour abstraction to the service interaction problem in intelligent networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00248-4openalex-snapshot
The equational logic of fixed points
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00312-xopenalex-snapshot
On syntactic congruences for ω-languages
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00498-6openalex-snapshot
Infinite Arrays and Domino Systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80262-2openalex-snapshot
Towards the Construction of an Abstract State-Space from a Partial-Order Representation of the Concrete One
inferred← citeshttps://doi.org/10.1023/a:1012781705048openalex-snapshot
Construction of an Automaton From a Formula of the Monadic First-Order Theory of Natural Numbers
inferred← citeshttps://doi.org/10.1145/259380.259419openalex-snapshot
Relative liveness and behavior abstraction (extended abstract)
inferred← citeshttps://doi.org/10.1155/2022/1493126openalex-snapshot
On Subclasses of Recognizable ωω−Partial Array Languages
inferred← citeshttps://doi.org/10.1207/s15327051hci1403_1openalex-snapshot
Timetrees: A Branching-Time Structure for Modeling Activity and State in Human-Computer Interaction
inferred← citeshttps://doi.org/10.5555/114836.114848openalex-snapshot
On the learnability of infinitary regular sets
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.