Speedup of recognizable trace languages

DOI10.1007/3-540-57182-5_25MaRDI QIDQ4260375zbMATH OpenFDO

Authors Christophe Cérin, A. Petit

Publication date 19 September 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57182-5_25

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 17820
• Recognizable trace languages, distributed automata and the distribution problem
• APPROXIMATING THE MEAN SPEEDUP IN TRACE MONOIDS

Cited in

(10)

• Rational and recognizable complex trace languages
• Computing the average parallelism in trace monoids.
• Two optimal parallel algorithms on the commutation class of a word
• Models for quantitative distributed systems and multi-valued logics
• APPROXIMATING THE MEAN SPEEDUP IN TRACE MONOIDS
• Traces of Control-Flow Graphs
• scientific article; zbMATH DE number 2086409 (Why is no real title available?)
• Uniform and Bernoulli measures on the boundary of trace monoids
• Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids
• Efficient recognition of trace languages defined by repeat-until loops

This page was built for publication: Speedup of recognizable trace languages

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