Pattern matching in trace monoids

DOI10.1007/BFb0023490zbMath1498.68380OpenAlexW197494724MaRDI QIDQ5048955

Jochen Messner

Publication date: 9 November 2022

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

Full work available at URL: https://doi.org/10.1007/bfb0023490

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The poset of infinitary traces
• Asynchronous mappings and asynchronous cellular automata
• On some equations in free partially commutative monoids
• String matching problems over free partially commutative monoids
• Recognizable subsets of some partially Abelian monoids
• Combinatorial problems of commutation and rearrangements
• Overlaps in free partially commutative monoids
• Efficient solution of some problems in free partially commutative monoids
• Fast Pattern Matching in Strings