620 search results - page 46 / 124 » Algorithms and computations on cellular automata |
84
Voted
ITNG
2007
IEEE
15 years 6 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
85
Voted
BIRTHDAY
1999
Springer
15 years 4 months ago
1999
Springer
We define simple-regular expressions and languages. Simple-regular languages provide a necessary condition for a language to be outfix-free. We design algorithms that compute si...
92
Voted
WIA
2001
Springer
15 years 5 months ago
2001
Springer
A vector algorithm is an algorithm that applies a bounded number of vector operations to an input vector, regardless of the length of the input. In this paper, we describe the link...
124
Voted
FORMATS
2006
Springer
15 years 4 months ago
2006
Springer
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
131
click to vote
FOSSACS
2011
Springer
14 years 4 months ago
2011
Springer
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...