Asynchronous trace-matching automata (Q466372): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Notes on finite asynchronous automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed product and asynchronous automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jewels of Stringology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion problems in trace monoids / rank
 
Normal rank

Revision as of 04:54, 9 July 2024

scientific article
Language Label Description Also known as
English
Asynchronous trace-matching automata
scientific article

    Statements

    Asynchronous trace-matching automata (English)
    0 references
    0 references
    0 references
    27 October 2014
    0 references
    asynchronous automaton
    0 references
    trace
    0 references
    matching
    0 references

    Identifiers