227 search results - page 36 / 46 » P Systems and Finite Automata |
FSTTCS
2004
Springer
14 years 3 months ago
2004
Springer
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
ANCS
2006
ACM
14 years 3 months ago
2006
ACM
Modern deep packet inspection systems use regular expressions to define various patterns of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used...
SIGCOMM
2006
ACM
14 years 3 months ago
2006
ACM
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
VMCAI
2005
Springer
14 years 3 months ago
2005
Springer
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
IWRIDL
2006
ACM
14 years 3 months ago
2006
ACM
We present the state of the art of a computational platform for the analysis of classical Sanskrit. The platform comprises modules for phonology, morphology, segmentation and shal...