From cascade decompositions to bit-vector algorithms. (Q1426154): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60704267, #quickstatements; #temporary_batch_1711565664090
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast bit-vector algorithm for approximate string matching based on dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4534878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of some problems from the theory of automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cascade synthesis of finite-state machines / rank
 
Normal rank

Latest revision as of 14:49, 6 June 2024

scientific article
Language Label Description Also known as
English
From cascade decompositions to bit-vector algorithms.
scientific article

    Statements

    Identifiers