scientific article; zbMATH DE number 4114058

MaRDI QIDQ4729377zbMATH OpenFDO

Authors Massimiliano Goldwurm, Alberto Bertoni

Publication date 1989

zbMATH Keywords

context-free trace languagesmembership problem

Mathematics Subject Classification ID

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

Recommendations

• Probabilistic estimation of the number of prefixes of a trace
• SOME LIMIT DISTRIBUTIONS IN ANALYSIS OF ALGORITHMS FOR PROBLEMS ON TRACE LANGUAGES
• Membership problems for regular and context-free trace languages
• scientific article; zbMATH DE number 3874641
• scientific article; zbMATH DE number 4058887

Cited in

(11)

• Probabilistic estimation of the number of prefixes of a trace
• Computing the average parallelism in trace monoids.
• Membership problems for regular and context-free trace languages
• Number of prefixes in trace monoids: clique polynomials and dependency graphs
• Uniform generation in trace monoids
• scientific article; zbMATH DE number 992008 (Why is no real title available?)
• scientific article; zbMATH DE number 3874641 (Why is no real title available?)
• SOME LIMIT DISTRIBUTIONS IN ANALYSIS OF ALGORITHMS FOR PROBLEMS ON TRACE LANGUAGES
• scientific article; zbMATH DE number 4058887 (Why is no real title available?)
• Pattern matching in trace monoids (extended abstract)
• Preface

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4729377)