scientific article

zbMath0648.68079MaRDI QIDQ3793747

Massimiliano Goldwurm, Nicoletta Sabadini, Alberto Bertoni

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

time complexityconcurrent alphabetMembership problemaverage case behaviourregular trace languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items

Clique polynomials have a unique root of smallest modulus, Preface, Probabilistic estimation of the number of prefixes of a trace, The lattices of prefixes and overlaps of traces, Determinants and Möbius functions in trace monoids, Number of prefixes in trace monoids: clique polynomials and dependency graphs