Sciweavers

1728 search results - page 37 / 346
» The Size of Power Automata
Sort
View
PODS
2008
ACM
143views Database» more  PODS 2008»
15 years 12 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin
ICSAP
2010
15 years 3 months ago
EEMLA: Energy Efficient Monitoring of Wireless Sensor Network with Learning Automata
— When sensors are redundantly deployed, a subset of sensors should be selected to actively monitor the field (referred to as a "cover"), while the rest of the sensors ...
Habib Mostafaei, Mohammad Reza Meybodi, Mehdi Esna...
VLSID
2003
IEEE
208views VLSI» more  VLSID 2003»
15 years 5 months ago
Cryptosystem Designed for Embedded System Security
— This paper reports a cryptosystem designed for security of embedded systems. It is based on the theory of Cellular Automata(CA). The Cellular Automata based Cryptosystem(CAC) e...
Subhayan Sen, Sk. Iqbal Hossain, Kabirul Islam, Di...
FORMATS
2005
Springer
15 years 5 months ago
Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems
Timed automata (TA) are a widely used model for real-time systems. Several tools are dedicated to this model, and they mostly implement a forward analysis for checking reachability...
Patricia Bouyer, François Laroussinie, Pier...
CADE
2001
Springer
15 years 4 months ago
Approximating Dependency Graphs Using Tree Automata Techniques
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
Aart Middeldorp