54 search results - page 11 / 11 » Deterministic Automata on Unranked Trees |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
SPAA
2010
ACM
13 years 10 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
EMSOFT
2006
Springer
13 years 9 months ago
2006
Springer
Distributed real-time systems require a predictable and verifiable mechanism to control the communication medium. Current real-time communication protocols are typically independe...