426 search results - page 9 / 86 » Synchronization of Regular Automata |
ACSD
2006
IEEE
13 years 9 months ago
2006
IEEE
Reuse of IP blocks has been advocated as a means to conquer the complexity of today's system-on-chip (SoC) designs. Component integration and verification in such systems is ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
GROUP
1997
ACM
13 years 12 months ago
1997
ACM
Team automata have been proposed in Ellis (1997) as a formal framework for modeling both the conceptual and the architectural level of groupware systems. Here we define team autom...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We define the "Pulse Synchronization" problem that requires nodes to achieve tight synchronization of regular pulse events, in the settings of distributed computing syste...
TIME
2002
IEEE
14 years 17 days ago
2002
IEEE
Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant finite autom...