7 search results - page 1 / 2 » Generation of Constants and Synchronization of Finite Automa... |
85
Voted
JUCS
2002
14 years 10 months ago
2002
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
82
Voted
CSR
2008
Springer
15 years 21 days ago
2008
Springer
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...
136
Voted
STRINGOLOGY
2008
15 years 10 days ago
2008
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
127
Voted
ATVA
2006
Springer
15 years 2 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
15 years 8 days 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...