620 search results - page 100 / 124 » Algorithms and computations on cellular automata |
105
click to vote
FM
1999
Springer
15 years 4 months ago
1999
Springer
We present novel techniques for efficient controller synthesis for untimed and timed systems with respect to invariance and reachability properties. In the untimed case, we give al...
105
click to vote
STRINGOLOGY
2008
15 years 1 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
91
Voted
IJCAI
1997
15 years 1 months ago
1997
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing ...
NETCOOP
2007
Springer
15 years 6 months ago
2007
Springer
Recently Gerald Ash has shown through case studies that event dependent routing is attractive in large scale multi-service MPLS networks. In this paper, we consider the application...
90
Voted
BMCBI
2010
15 years 20 days ago
2010
Background: Post-translational modifications (PTMs) have a key role in regulating cell functions. Consequently, identification of PTM sites has a significant impact on understandi...