20 search results - page 2 / 4 » Synchronization and Stability of Finite Automata |
CSR
2010
Springer
13 years 8 months ago
2010
Springer
We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of...
IJCAI
1993
13 years 6 months ago
1993
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
PTS
2007
13 years 6 months ago
2007
Abstract. We propose an extension of the Finite State Machine framework in distributed systems, using input/output partial order automata (IOPOA). In this model, transitions can be...
ATVA
2006
Springer
13 years 8 months ago
2006
Springer
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
FBT
1998
13 years 6 months ago
1998
We build on work in designing modeling languages for hybrid systems in the development of CTA, the Cottbus Timed Automata. Our design features a facility to specify a hybrid system...