3653 search results - page 361 / 731 » On Recognizable Timed Languages |
208
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
169
click to vote
APCSAC
2001
IEEE
15 years 10 months ago
2001
IEEE
A popular trend in current software technology is to gain program portability by compiling programs to an inte form based on an abstract machine definition. Such approaches date b...
179
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
158
click to vote
IFIP
2000
Springer
15 years 10 months ago
2000
Springer
The academic field of information systems has developed because organizations use a specialized body of knowledge about information and communications systems. Teaching and resear...
193
click to vote
JAVA
2000
Springer
15 years 10 months ago
2000
Springer
This paper describes a portable and efficient sampling-based online measurement system for production-level Java virtual machines. This system is designed to provide continuous re...