منابع مشابه
Detecting patterns in finite regular and context-free languages
We consider variations on the following problem: given an NFA M over the alphabet Σ and a pattern p over some alphabet ∆, does there exist an x ∈ L(M) such that p matches x? We consider the restricted problem where M only accepts a finite language. We also consider the variation where the pattern p is required only to match a factor of x. We show that both of these problems are NP-complete. We ...
متن کاملDetecting palindromes, patterns and borders in regular languages
Article history: Received 5 June 2008 Available online 19 March 2009
متن کاملDetecting Regular Patterns Using Frequency Domain Self-Filtering
Donald G. Bailey Physics Department, Massey University Palmerston North, New Zealand D.G.Bailey @ massey . ac.nz Filtering is often used in image processing to smooth noise, and to enhance or detect features within an image. Images which have regular patterns in the spatial domain have peaks in the frequency domain corresponding to the spatial frequencies of the regular patterns. When processin...
متن کاملPatterns of communication during the preanesthesia visit.
BACKGROUND Effective communication in the preanesthesia clinic is important in patient-centered care. Although patient-physician communication has been studied by recordings in other contexts, there have been no observational studies of the communication patterns of anesthesiologists and patients during the preanesthesia interview. METHODS Two experienced standardized patients were trained to...
متن کاملRegular Symmetry Patterns
Symmetry reduction is a well-known approach for alleviating the state explosion problem in model checking. Automatically identifying symmetries in concurrent systems, however, is computationally expensive. We propose a symbolic framework for capturing symmetry patterns in parameterised systems (i.e. an infinite family of finite-state systems): two regular word transducers to represent, respecti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2009
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-009-9376-2