On the public citation graph
Characterizations of the decidability of some problems for regular trace languages
0 signed · 75 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-10856-4_86openalex-snapshot
An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
inferredcites →https://doi.org/10.1007/3-540-15204-0_10openalex-snapshot
Fair serializability of iterated transactions using fifo-nets
inferredcites →https://doi.org/10.1007/3-540-15204-0_20openalex-snapshot
Semantics of concurrent systems: A modular fixed-point trace approach
inferredcites →https://doi.org/10.1007/3-540-18088-5_20openalex-snapshot
Decision problems for regular trace languages
inferredcites →https://doi.org/10.1007/978-3-663-09367-1openalex-snapshot
Transductions and Context-Free Languages
inferredcites →https://doi.org/10.1007/bfb0012757openalex-snapshot
Equivalence and membership problems for regular trace languages
inferredcites →https://doi.org/10.1007/bfb0016231openalex-snapshot
Recent results in the theory of rational sets
inferredcites →https://doi.org/10.1007/bfb0030293openalex-snapshot
Traces, histories, graphs: Instances of a process monoid
inferredcites →https://doi.org/10.1007/bfb0079468openalex-snapshot
Problèmes combinatoires de commutation et réarrangements
inferredcites →https://doi.org/10.1016/0020-0271(67)90007-1openalex-snapshot
The mathematical theory of context-free languages
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0096-0551(80)90068-5openalex-snapshot
Introduction to formal language theory
inferredcites →https://doi.org/10.1016/0166-218x(85)90080-0openalex-snapshot
Traces, dependency graphs and DNLC grammars
inferredcites →https://doi.org/10.1016/0304-3975(84)90053-7openalex-snapshot
Partial commutations and faithful rational transductions
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(86)90101-5openalex-snapshot
On the decidability of some problems about rational subsets of free partially commutative monoids
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1051/ita/1985190100211openalex-snapshot
Automates et commutations partielles
inferredcites →https://doi.org/10.1051/ita/1986200201031openalex-snapshot
Trace languages defined by regular string languages
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.1090/s0002-9939-1965-0172274-5openalex-snapshot
A Note on "The Comparability Graph of a Tree"
inferredcites →https://doi.org/10.1145/322047.322058openalex-snapshot
Reversal-Bounded Multicounter Machines and Their Decision Problems
inferredcites →https://doi.org/10.2307/1970290openalex-snapshot
Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines
inferredcites →https://doi.org/10.2307/2313471openalex-snapshot
Computation: Finite and Infinite Machines.
inferredcites →https://doi.org/10.5860/choice.26-3305openalex-snapshot
An introduction to formal language theory
inferredcites →https://doi.org/10.7146/dpb.v6i78.7691openalex-snapshot
Concurrent Program Schemes and their Interpretations
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.1996.0088openalex-snapshot
Any Lifting of a Trace Coding Is a Word Coding
inferred← citeshttps://doi.org/10.1006/inco.1999.2847openalex-snapshot
Model-Checking of Correctness Conditions for Concurrent Objects
inferred← citeshttps://doi.org/10.1007/11505877_31openalex-snapshot
The Inclusion Problem for Unambiguous Rational Trace Languages
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_41openalex-snapshot
Existential and Positive Theories of Equations in Graph Products
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-60249-6_71openalex-snapshot
On the synchronization of semi-traces
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_190openalex-snapshot
Solving trace equations using lexicographical normal forms
inferred← citeshttps://doi.org/10.1007/978-3-031-64309-5_5openalex-snapshot
Membership Problems in Infinite Groups
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-15579-1_1openalex-snapshot
Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications
inferred← citeshttps://doi.org/10.1007/978-3-319-24537-9_15openalex-snapshot
The Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets
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-642-59126-6_8openalex-snapshot
Partial Commutation and Traces
inferred← citeshttps://doi.org/10.1007/bf01185864openalex-snapshot
Logical definability of some rational trace languages
inferred← citeshttps://doi.org/10.1007/bfb0023848openalex-snapshot
The “last” decision problem for rational trace languages
inferred← citeshttps://doi.org/10.1007/s00224-003-1110-xopenalex-snapshot
Existential and Positive Theories of Equations in Graph Products
inferred← citeshttps://doi.org/10.1007/s00233-013-9553-0openalex-snapshot
Fixed points of endomorphisms of trace monoids
inferred← citeshttps://doi.org/10.1007/s00233-021-10216-8openalex-snapshot
The word problem for one-relation monoids: a survey
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90314-6openalex-snapshot
Probabilistic estimation of the number of prefixes of a trace
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90375-popenalex-snapshot
Rational relations and rational series
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00036-vopenalex-snapshot
On some decision problems for trace codings
inferred← citeshttps://doi.org/10.1016/j.ic.2017.09.012openalex-snapshot
Decidability and complexity for quiescent consistency and its variations
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104583openalex-snapshot
The emptiness problem for valence automata over graph monoids
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2007.08.025openalex-snapshot
The submonoid and rational subset membership problems for graph groups
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00446-1openalex-snapshot
On the support of graph Lie algebras
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.1016/s0304-3975(98)00313-2openalex-snapshot
Solving word equations modulo partial commutations
inferred← citeshttps://doi.org/10.1017/cbo9781316227343.024openalex-snapshot
The rational subset membership problem for groups: a survey
inferred← citeshttps://doi.org/10.1051/ita/1998321-300791openalex-snapshot
On the inclusion problem for finitely ambiguous rational trace languages
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/lics.1996.561322openalex-snapshot
Model-checking of correctness conditions for concurrent objects
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/s021819670800438xopenalex-snapshot
RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS
inferred← citeshttps://doi.org/10.1142/s0218196708004548openalex-snapshot
WORD EQUATIONS OVER GRAPH PRODUCTS
inferred← citeshttps://doi.org/10.1142/s0218196718500509openalex-snapshot
Intersection problem for Droms RAAGs
inferred← citeshttps://doi.org/10.1145/2933575.2933576openalex-snapshot
Decidability and Complexity for Quiescent Consistency
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.32657/10356/65641openalex-snapshot
Towards decentralized and parameterized supervisor synthesis
inferred← citeshttps://doi.org/10.3934/amc.2024036openalex-snapshot
Subsets of groups in public-key cryptography
inferred← citeshttps://doi.org/10.46298/dmtcs.5884openalex-snapshot
Weak equivalence of higher-dimensional automata
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.1610.00373openalex-snapshot
The Complexity of Knapsack in Graph Groups
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.5821/dissertation-2117-112428openalex-snapshot
Extensions of free groups: algebraic, geometric, and algorithmic aspects
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.