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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10559-012-9411-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013716841 / rank
 
Normal rank
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

Latest revision as of 05: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
    0 references
    asynchronous automaton
    0 references
    trace
    0 references
    matching
    0 references
    0 references