Asynchronous trace-matching automata

DOI10.1007/S10559-012-9411-1MaRDI QIDQ466372zbMATH OpenOpenAlexFDO

Authors K. V. Shahbazyan, Yu. H. Shoukourian

Publication date 27 October 2014

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-012-9411-1

zbMATH Keywords

matchingtraceasynchronous automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• Pattern matching in trace monoids (extended abstract)
• scientific article; zbMATH DE number 5953970
• Inclusion problems in trace monoids
• Distributed Asynchronous Automata
• scientific article; zbMATH DE number 1015097

Cites work

• scientific article; zbMATH DE number 1305002 (Why is no real title available?)
• Algorithms on Strings
• Efficient string matching
• Inclusion problems in trace monoids
• Jewels of Stringology
• Mathematical Foundations of Computer Science 2005
• Mixed product and asynchronous automata
• Notes on finite asynchronous automata
• Searching subsequences

Cited in

(7)

• Forbidden traces and forbidden subtraces
• Inclusion problems in trace monoids
• scientific article; zbMATH DE number 3497800 (Why is no real title available?)
• 2-asynchronous automata
• Deterministic asynchronous automata for infinite traces
• scientific article; zbMATH DE number 3978397 (Why is no real title available?)
• Pattern matching in trace monoids (extended abstract)

This page was built for publication: Asynchronous trace-matching automata

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