Distributed string matching using finite automata

Authors :: Holub, J.
Iliopoulos, C.S.
Melichar, B.
Mouchard, L.
Department of computer science and ingineering
Faculty of Electrical Engineering [Prague] (FEL CTU)
Czech Technical University in Prague (CTU)-Czech Technical University in Prague (CTU)
Department of Computer Science (DCS)
King‘s College London
Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes (LITIS)
Institut national des sciences appliquées Rouen Normandie (INSA Rouen Normandie)
Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Institut National des Sciences Appliquées (INSA)-Normandie Université (NU)-Université de Rouen Normandie (UNIROUEN)
Normandie Université (NU)-Université Le Havre Normandie (ULH)
Normandie Université (NU)
Source :: Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms
Publication Year :: 1999
Publisher :: HAL CCSD, 1999.
Abstract: International audience

Subjects :: [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM]
[SDV.BIBS]Life Sciences [q-bio]/Quantitative Methods [q-bio.QM]
ComputingMilieux_MISCELLANEOUS

Language :: English
Database :: OpenAIRE
Journal :: Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms
Accession number :: edsair.dedup.wf.001..f7c07a96a6a972a1972dd706f40cbd13

Tools