1705 search results - page 135 / 341 » Representing Constraints with Automata |
129
click to vote
HYBRID
1994
Springer
15 years 8 months ago
1994
Springer
This paper presents algorithms for the symbolic synthesis of discrete and real-time controllers. At the semantic level the controller is synthesized by nding a winning strategy for...
141
Voted
DFT
2004
IEEE
15 years 8 months ago
2004
IEEE
Quantum dot Cellular Automata (QCA) is amongst promising new computing scheme in the nano-scale regimes. As an emerging technology, QCA relies on radically different operations in...
130
click to vote
HYBRID
1995
Springer
15 years 8 months ago
1995
Springer
The theory of supervisory control of discrete event systems is extended to the real-time setting. The real-time behavior of a system is represented by the set of all possible time...
169
click to vote
FASE
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
124
click to vote
IJCAI
1997
15 years 5 months ago
1997
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing ...