20 search results - page 2 / 4 » Synchronization and Stability of Finite Automata |
149
click to vote
CSR
2010
Springer
15 years 9 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...
146
Voted
IJCAI
1993
15 years 7 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...
148
click to vote
PTS
2007
15 years 7 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...
203
Voted
ATVA
2006
Springer
15 years 10 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...
159
click to vote
FBT
1998
15 years 7 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...