25 search results - page 4 / 5 » Finite State Automata Representing Two-Dimensional Subshifts |
IEEESCC
2005
IEEE
14 years 1 months ago
2005
IEEE
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the cont...
FASE
2008
Springer
13 years 9 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 ...
CIMCA
2006
IEEE
14 years 1 months ago
2006
IEEE
The MPSG (Message-based Part State Graph) model has been developed for the execution portion of shop-floor controllers that operate in a distributed and hierarchical control envir...