3229 search results - page 113 / 646 » The Theory of Timed Automata |
133
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
We present a new series of run-rich strings, and give a new lower bound 0.94457567 of the maximum number of runs in a string. We also introduce the general conjecture about a asymp...
240
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
Deciding whether a finite set of polyominoes tiles the plane is undecidable by reduction from the Domino problem. In this paper, we prove that the problem remains undecidable if t...
191
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we survey some results in inductive inference showing how learnability of a class of languages may depend on hypothesis space chosen. We also discuss results which co...
158
click to vote
RP
2009
Springer
16 years 29 days ago
2009
Springer
We describe the class of games with opacity condition, as an adequate model for security aspects of computing systems. We study their theoretical properties, relate them to reachab...
177
click to vote
TACS
2001
Springer
15 years 11 months ago
2001
Springer
Lossy channel systems are systems of finite state automata that communicate via unreliable unbounded fifo channels. Today the main open question in the theory of lossy channel sy...