On the public citation graph
The “last” decision problem for rational trace languages
0 signed · 71 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-3-663-09367-1openalex-snapshot
Transductions and Context-Free Languages
inferredcites →https://doi.org/10.1007/bf02088289openalex-snapshot
Characterizations of the decidability of some problems for regular trace 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/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1051/ita/1986200201031openalex-snapshot
Trace languages defined by regular string languages
inferredcites →https://doi.org/10.1090/s0002-9947-1964-0181500-1openalex-snapshot
Bounded 𝐴𝐿𝐺𝑂𝐿-like languages
inferredcites →https://doi.org/10.1145/322047.322058openalex-snapshot
Reversal-Bounded Multicounter Machines and Their Decision Problems
inferredcites →https://doi.org/10.1147/rd.91.0047openalex-snapshot
On Relations Defined by Generalized Finite Automata
inferredcites →https://doi.org/10.2140/pjm.1966.16.285openalex-snapshot
Semigroups, Presburger formulas, and languages
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.1995.1088openalex-snapshot
New Results on the Star Problem in Trace Monoids
inferred← citeshttps://doi.org/10.1006/inco.2002.3152openalex-snapshot
The Star Problem and the Finite Power Property in Trace Monoids: Reductions beyond C4
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_57openalex-snapshot
On Message Sequence Graphs and Finitely Generated Regular MSC Languages
inferred← citeshttps://doi.org/10.1007/3-540-45315-6_22openalex-snapshot
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_43openalex-snapshot
Recognizable Sets of Message Sequence Charts
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_49openalex-snapshot
The Star Problem in Trace Monoids: Reductions Beyond C4
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_8openalex-snapshot
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_44openalex-snapshot
A Connection between the Star Problem and the Finite Power Property in Trace Monoids (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_45openalex-snapshot
Two Techniques in the Area of the Star Problem
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_21openalex-snapshot
Some Undecidability Results Related to the Star Problem in Trace Monoids
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_153openalex-snapshot
On the star operation and the finite power property in free partially commutative monoids
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_104openalex-snapshot
Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_89openalex-snapshot
Coding and strong coding in trace monoids
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_64openalex-snapshot
Computing the closure of sets of words under partial commutations
inferred← citeshttps://doi.org/10.1007/978-3-030-79121-6_5openalex-snapshot
The Commutative Closure of Shuffle Languages over Group Languages is Regular
inferred← citeshttps://doi.org/10.1007/978-3-031-52113-3_22openalex-snapshot
Automata Classes Accepting Languages Whose Commutative Closure is Regular
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/978-3-319-62809-7_18openalex-snapshot
The Generalized Rank of Trace Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-67089-8_8openalex-snapshot
Topological Characterisation of Multi-buffer Simulation
inferred← citeshttps://doi.org/10.1007/978-3-540-24597-1_14openalex-snapshot
Word Equations over Graph Products
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_2openalex-snapshot
Synthesis of Distributed Algorithms Using Asynchronous Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_18openalex-snapshot
When Does Partial Commutative Closure Preserve Regularity?
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_29openalex-snapshot
Realizability of Concurrent Recursive Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-01492-5_10openalex-snapshot
Traces, Series-Parallel Posets, and Pictures: A Weighted Study
inferred← citeshttps://doi.org/10.1007/978-3-642-16558-0_45openalex-snapshot
Analysing Message Sequence Graph Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-25535-9_7openalex-snapshot
Decidability Results for Choreography Realization
inferred← citeshttps://doi.org/10.1007/978-3-642-28332-1_38openalex-snapshot
Canonizable Partial Order Generators
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_8openalex-snapshot
Partial Commutation and Traces
inferred← citeshttps://doi.org/10.1007/s00224-001-0006-xopenalex-snapshot
Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90187-zopenalex-snapshot
Decidability of the Star Problem in
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00187-5openalex-snapshot
A note on the commutative closure of star-free languages
inferred← citeshttps://doi.org/10.1016/j.ic.2004.08.004openalex-snapshot
A theory of regular MSC languages
inferred← citeshttps://doi.org/10.1016/j.ic.2013.07.003openalex-snapshot
Regular languages and partial commutations
inferred← citeshttps://doi.org/10.1016/j.ic.2018.09.008openalex-snapshot
Multi-buffer simulations: Decidability and complexity
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103601openalex-snapshot
Backwards-reachability for cooperating multi-pushdown systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.11.031openalex-snapshot
Weighted asynchronous cellular automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.06.023openalex-snapshot
Local testability from words to traces, a suitable definition
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00313-xopenalex-snapshot
Two techniques in the area of the star problem in trace monoids
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00216-2openalex-snapshot
The code problem for traces — improving the boundaries
inferred← citeshttps://doi.org/10.1109/acc.2014.6858608openalex-snapshot
Towards decentralized synthesis: Decomposable sublanguage and Joint Observability Problems
inferred← citeshttps://doi.org/10.1109/acsd.2007.33openalex-snapshot
Synthesis and Control of Asynchronous and Distributed Systems
inferred← citeshttps://doi.org/10.1109/tac.2015.2447193openalex-snapshot
On Distributed and Parameterized Supervisor Synthesis Problems
inferred← citeshttps://doi.org/10.1109/tac.2017.2692561openalex-snapshot
Reduction of Distributions: Definitions, Properties, and Applications
inferred← citeshttps://doi.org/10.1109/tac.2018.2828105openalex-snapshot
Automatic Generation of Optimal Reductions of Distributions
inferred← citeshttps://doi.org/10.1109/tac.2023.3257232openalex-snapshot
Hierarchical Supervisory Control Under Partial Observation: Normality
inferred← citeshttps://doi.org/10.1137/22m1512612openalex-snapshot
Decidability of Membership Problems for Flat Rational Subsets of \(\boldsymbol{{\textrm{GL}}(2,\boldsymbol{{\mathbb{Q}}})}\) and Singular Matrices
inferred← citeshttps://doi.org/10.1142/9789812773036_0019openalex-snapshot
ANCHORED CONCATENATION OF MSCs
inferred← citeshttps://doi.org/10.1142/9789814271059_0010openalex-snapshot
The Theory of Message Sequence Charts
inferred← citeshttps://doi.org/10.1142/s021819670800438xopenalex-snapshot
RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS
inferred← citeshttps://doi.org/10.1145/2933575.2934552openalex-snapshot
First-order logic with reachability for infinite-state systems
inferred← citeshttps://doi.org/10.1145/3373207.3404038openalex-snapshot
Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices
inferred← citeshttps://doi.org/10.18419/opus-2573openalex-snapshot
Automatic synthesis of distributed transition systems
inferred← citeshttps://doi.org/10.32657/10356/65641openalex-snapshot
Towards decentralized and parameterized supervisor synthesis
inferred← citeshttps://doi.org/10.4204/eptcs.226.15openalex-snapshot
Multi-Buffer Simulations for Trace Language Inclusion
inferred← citeshttps://doi.org/10.48550/arxiv.1009.5341openalex-snapshot
Canonizable Partial Order Generators and Regular Slice Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1910.02302openalex-snapshot
Decidability of membership problems for flat rational subsets of $\mathrm{GL}(2,\mathbb{Q})$ and singular matrices
inferred← citeshttps://doi.org/10.48550/arxiv.2008.05420openalex-snapshot
The Commutative Closure of Shuffle Expressions over Group Languages is Regular
inferred← citeshttps://doi.org/10.70675/c3eebce1z831bz424ezb37bzafd8c00bc9fcopenalex-snapshot
Vérification de réseaux de Pétri avec états sous une sémantique d'ordres partiels
inferred← citeshttps://doi.org/10.7146/brics.v6i52.20122openalex-snapshot
Towards a Theory of Regular MSC 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.