Pattern matching in trace monoids (extended abstract)

DOI10.1007/BFB0023490zbMATH Open1498.68380OpenAlexW197494724MaRDI QIDQ5048955FDOQ5048955

Authors: 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

Recommendations

• scientific article; zbMATH DE number 5953970
• Inclusion problems in trace monoids
• Asynchronous trace-matching automata
• scientific article; zbMATH DE number 4114058
• Two recognizable string-matching problems over free partially commutative monoids

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Recognizable subsets of some partially Abelian monoids
• Fast Pattern Matching in Strings
• Combinatorial problems of commutation and rearrangements
• Title not available (Why is that?)
• Asynchronous mappings and asynchronous cellular automata
• On some equations in free partially commutative monoids
• Title not available (Why is that?)
• The poset of infinitary traces
• Efficient solution of some problems in free partially commutative monoids
• String matching problems over free partially commutative monoids
• Overlaps in free partially commutative monoids

Cited In (5)

• Inclusion problems in trace monoids
• A sheaf-theoretic approach to pattern matching and related problems
• Two recognizable string-matching problems over free partially commutative monoids
• Title not available (Why is that?)
• Asynchronous trace-matching automata

This page was built for publication: Pattern matching in trace monoids (extended abstract)

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