Two optimal parallel algorithms on the commutation class of a word

DOI10.1016/J.TCS.2004.03.048zbMath1105.68066OpenAlexW2000242366MaRDI QIDQ1882917

René Schott, Jean-Claude Spehner

Publication date: 1 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.048

zbMATH Keywords

parallel algorithmautomatonpartially commutative monoidcommutation class

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Parallel algorithms in computer science (68W10) Algebraic theory of languages and automata (68Q70)

Cites Work

• Combinatorics on traces
• Combinatorial problems of commutation and rearrangements
• Notes on finite asynchronous automata
• Parallel Prefix Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two optimal parallel algorithms on the commutation class of a word