Asynchronous trace-matching automata

DOI10.1007/s10559-012-9411-1zbMath1298.68156OpenAlexW2013716841MaRDI QIDQ466372

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

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

Related Items

Forbidden traces and forbidden subtraces

Cites Work

• Unnamed Item
• Mixed product and asynchronous automata
• Inclusion problems in trace monoids
• Searching subsequences
• Notes on finite asynchronous automata
• Efficient string matching
• Jewels of Stringology
• Algorithms on Strings
• Mathematical Foundations of Computer Science 2005