Zerotesting bounded one-way multicounter machines
Pavol Ďuriš, Juraj Hromkovič (1987)
Kybernetika
Similarity:
Pavol Ďuriš, Juraj Hromkovič (1987)
Kybernetika
Similarity:
Juraj Hromkovič (1986)
Kybernetika
Similarity:
Marie-Pierre Béal, Olivier Carton (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Marie-Pierre Béal, Olivier Carton (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Martin Beran (2002)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The class of weak parallel machines is interesting, because it contains some realistic parallel machine models, especially suitable for pipelined computations. We prove that a modification of the bulk synchronous parallel (BSP) machine model, called decomposable BSP (dBSP), belongs to the class of weak parallel machines if restricted properly. We will also correct some earlier results about pipelined parallel Turing machines.
Jan Holub (2002)
Kybernetika
Similarity:
searching for all occurrences of a pattern (string or sequence) in some text, where the pattern can occur with some limited number of errors given by edit distance. Several methods were designed for the approximate string matching that simulate nondeterministic finite automata (NFA) constructed for this problem. This paper presents reduced NFAs for the approximate string matching usable in case, when we are interested only in occurrences having edit distance less than or equal to a given...