scientific article
From MaRDI portal
Publication:3947146
zbMath0486.68079MaRDI QIDQ3947146
Giancarlo Mauri, Nicoletta Sabadini, Alberto Bertoni
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
decidabilitymembership problemequivalence problemfree partially commutative monoidconcurrent alphabetbehaviour of concurrent systems
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items
On the structure of recognizable languages of dependence graphs, On regular trace languages, On the decidability of some problems about rational subsets of free partially commutative monoids, Efficient solution of some problems in free partially commutative monoids, Theory of traces, On recognizable subsets of free partially commutative monoids, Complete subgraphs of bipartite graphs and applications to trace languages, Trace languages defined by regular string languages, The code problem for traces -- improving the boundaries, Probabilistic asynchronous automata, From non-preemptive to preemptive scheduling using synchronization synthesis, Preface, Trace monoids with some invertible generators: Two decision problems, On the decidability of the equivalence problem for partially commutative rational power series, Compositions de fonctions de commutation partielle, The lattices of prefixes and overlaps of traces, Membership problems for regular and context-free trace languages, Characterizations of the decidability of some problems for regular trace languages, Partial commutations and faithful rational transductions, \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs, Number of prefixes in trace monoids: clique polynomials and dependency graphs
