227 search results - page 9 / 46 » P Systems and Finite Automata |
CAV
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
72
Voted
CSR
2010
Springer
15 years 29 days ago
2010
Springer
We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
For applications to cryptography, it is important to represent numbers with a small number of non-zero digits (Hamming weight) or with small absolute sum of digits. The problem of ...
FORMATS
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
85
Voted
GLOBECOM
2010
IEEE
14 years 7 months ago
2010
IEEE
Multi-string matching is a key technique for implementing network security applications like Network Intrusion Detection Systems (NIDS) and anti-virus scanners. Existing DFA-based ...