10871 search results - page 450 / 2175 » A stable programming language |
170
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
142
Voted
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
The list update problem is a classical online problem, with an optimal competi
136
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
d Abstract) Christian Cachin1 , Jan Camenisch1 , Joe Kilian2 , and Joy M
121
Voted
IFIP
2000
Springer
15 years 10 months ago
2000
Springer
158
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1