Algorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended Version)

DOI10.7561/SACS.2013.2.229zbMATH Open1424.06001DBLPjournals/cuza/MikulskiPS13OpenAlexW2319522575WikidataQ104379754 ScholiaQ104379754MaRDI QIDQ4621173FDOQ4621173

Authors: Łukasz Mikulski, Marcin Piątowski, Sebastian Smyczyński 

Publication date: 8 February 2019

Published in: Scientific Annals of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7561/sacs.2013.2.229

Recommendations

• Algorithmic combinatorics on partial words
• On posets of \(m\)-ary words
• Algorithmic Combinatorics on Partial Words
• Computing the closure of sets of words under partial commutations
• scientific article; zbMATH DE number 3972221
• scientific article; zbMATH DE number 1737190
• Some Algebraic Properties of Machine Poset of Infinite Words
• Post correspondence problem with partially commutative alphabets
• Word posets, with applications to Coxeter groups
• Periodicity algorithms and a conjecture on overlaps in partial words

zbMATH Keywords

algorithmsposetHasse diagramgenerationspartially commutative alphabets

Mathematics Subject Classification ID

Partial orders, general (06A06) Algebraic aspects of posets (06A11)

Cited In (4)

• Title not available (Why is that?)
• Some Algebraic Properties of Machine Poset of Infinite Words
• Title not available (Why is that?)
• Compression of Words Over a Partially Commutative Alphabet

This page was built for publication: Algorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended Version)

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