"RIV/68407700:21230/06:03120236" . . . . "Nen\u00ED k dispozici"@cs . . . . . . "3-540-48815-4" . . "RIV/68407700:21230/06:03120236!RIV07-GA0-21230___" . "A New Approach to Determinisation Using Bit-Parallelism"@en . "P(GA201/06/1039), S, Z(MSM6840770014)" . . . "Tunis" . "2"^^ . "2"^^ . "463622" . "Springer-Verlag" . . . . "Heidelberg" . "A New Approach to Determinisation Using Bit-Parallelism" . "Nen\u00ED k dispozici"@cs . "[B9F56B7C2FF7]" . . . "\u0160upol, Jan" . "We present a new approach to the determinisation process of specified types of automata using bit-parallel algorithms. We present the determinisation of nondeterministic pattern matching automata (PMA) for approximate pattern matching and we introduce the determinisation of suffix automata. This new approach speeds the determinisation up to m times, where m is the length of the pattern searched by PMA, or accepted by the suffix automaton, respectively."@en . . "21230" . "Melichar, Booivoj" . "We present a new approach to the determinisation process of specified types of automata using bit-parallel algorithms. We present the determinisation of nondeterministic pattern matching automata (PMA) for approximate pattern matching and we introduce the determinisation of suffix automata. This new approach speeds the determinisation up to m times, where m is the length of the pattern searched by PMA, or accepted by the suffix automaton, respectively." . "Lecture Notes in Computer Science 4281, Theoretical Aspects of Computing - ICTAC 2006" . "Nen\u00ED k dispozici"@cs . . . "approximate matching; bit-parallelism; determinisation; finite automata; pattern matching"@en . "A New Approach to Determinisation Using Bit-Parallelism" . . "A New Approach to Determinisation Using Bit-Parallelism"@en . "14"^^ . . "2006-11-22+01:00"^^ . "228 ; 241" . .