Some remarks on synchronization, games and planar automata
Abstract—We study synchronization games on planar automata. We prove that recognizing the planar games that can be won by the synchronizer is a co-NP hard problem. We prove some additional results indicating that planar games are as hard as nonplanar games. Those results amount to show that planar...
Guardado en:
| Autores principales: | Montoya, J. Andrés, Nolasco, Christian |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2017
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/65164 |
| Aporte de: |
Ejemplares similares
-
Perspectives on synchronicity, inspiration, and the soul /
por: Sneller, Rico, 1967-
Publicado: (2020) -
Control of non-conventional synchronous motors
Publicado: (2012) -
Low Computational Cost GNSS GPS/GLONASS Maximum Likelihood Bit Synchronization Method
por: Puga, Gerardo Ludovico, et al.
Publicado: (2012) -
Integrating interactive tools using concurrent haskell and synchronous events
por: Karlsen, Einar W.
Publicado: (1997) -
Time series modeling and synchronization using neural networks
por: Cofiño, Antonio S., et al.
Publicado: (2000)