Titlebook: Vorträge der Jahrestagung 1974 DGOR Papers of the Annual Meeting; H.-J. Zimmermann,A. Schub,J. Stoer Conference proceedings 1974 Springer-

follicular-unit

L. Molnare sizes of deterministic finite automata recognizing the operands of the operation. We study the state complexity of intersection, union, concatenation, star, and reversal on the classes of combinational, singleton, finitely generated left ideal, symmetric definite, star, comet, two-sided comet, ord

stratum-corneum

R. D. Wiebking stochastic regular language where each pattern string has its own probability. Our problem is to find all matching patterns—(start, end) indices in the text—whose probability is larger than a given threshold probability. A pattern matching procedure is frequently used on streaming data in several a

鲁莽

immunity

R. Schmidtrk fast and efficiently, a serious problem, the regular expression denial-of-service (ReDoS), has been reported recently. ReDoS is an algorithm complexity attack, which exploits the backtracking feature of the engine, and makes the service unresponsive indefinitely. Researchers suggested a few remed

exquisite