Zobrazeno 1 - 10
of 57
pro vyhledávání: '"Thomas Worsch"'
Autor:
Simon Wacker, Thomas Worsch
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 90, Iss Proc. AUTOMATA&JAC 2012, Pp 236-254 (2012)
While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata. We first discuss a few possibilities and then investigate what we call phase space
Externí odkaz:
https://doaj.org/article/f09a039e9e9c47d1a6800eb380af7c12
Autor:
Augusto Modanese, Thomas Worsch
Publikováno v:
LATIN 2022: Theoretical Informatics ISBN: 9783031206238
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9bf284250774c38a6f5af6325f89848
https://doi.org/10.1007/978-3-031-20624-5_24
https://doi.org/10.1007/978-3-031-20624-5_24
Autor:
Thomas Worsch, Martin Kutrib
Publikováno v:
Cellular Automata and Discrete Complex Systems ISBN: 9783030209803
Automata
Automata
We study the computational capacity of self-verifying iterative arrays (\(\text {SVIA}\)). A self-verifying device is a nondeterministic device whose nondeterminism is symmetric in the following sense. Each computation path can give one of the answer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a124e32b6710026695a49fe25a35ba09
https://doi.org/10.1007/978-3-030-20981-0_6
https://doi.org/10.1007/978-3-030-20981-0_6
Publikováno v:
Natural computing, 19 (4), 759–772
We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidable characterization of cellular automata which can be written as a sin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::89041262aa94ce028c8cd135590a1606
http://arxiv.org/abs/1802.06668
http://arxiv.org/abs/1802.06668
Publikováno v:
Cellular Automata and Discrete Complex Systems ISBN: 9783319926742
Automata
Automata
We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidable characterization of cellular automata which can be written as a sin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f7f7c9d6ba1e8e4c349a827d3604a80
https://doi.org/10.1007/978-3-319-92675-9_6
https://doi.org/10.1007/978-3-319-92675-9_6
Autor:
Thomas Worsch, Martin Kutrib
Publikováno v:
Developments in Language Theory ISBN: 9783319986531
ACRI
ACRI
We study the computational capacity of self-verifying cellular automata with an emphasis on one-way information flow (\(\text {SVOCA}\)). A self-verifying device is a nondeterministic device where each computation path can give one of the answers yes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4598fc88910e910af99b37045cd81b49
https://doi.org/10.1007/978-3-319-99813-8_31
https://doi.org/10.1007/978-3-319-99813-8_31
Autor:
Thomas Worsch
Publikováno v:
Natural Computing. 12:539-550
We consider asynchronous one-dimensional cellular automata (CA). It is shown that there is one with von Neumann neighborhood of radius 1 which can simulate each asynchronous one-dimensional cellular automaton. Analogous constructions are described fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8b1753ad1eb3050afc05ebafbfca465c
https://doi.org/10.1007/s11047-013-9388-3
https://doi.org/10.1007/s11047-013-9388-3
Autor:
Simon Wacker, Thomas Worsch
Publikováno v:
Fundamenta Informaticae. 126:157-181
While for synchronous deterministic cellular automata there is an accepted definition of reversibility, this is not the case for asynchronous cellular automata. We first discuss a few possibilities and then investigate what we call phase space invert
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a232598816841541bbcf255051765182
https://doi.org/10.3233/fi-2013-876
https://doi.org/10.3233/fi-2013-876
Autor:
Augusto Modanese, Thomas Worsch
Publikováno v:
Cellular Automata and Discrete Complex Systems ISBN: 9783319392998
Automata
Automata
Inspired by shrinking cellular automata (SCA), we investigate another variant of the classical one-dimensional cellular automaton: the shrinking and expanding cellular automaton (SXCA). In addition to the capability to delete some cells as in SCA, an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::72d3da761bdceabe43eca4cd6ebeb33d
https://doi.org/10.1007/978-3-319-39300-1_13
https://doi.org/10.1007/978-3-319-39300-1_13
Publikováno v:
Natural Computing
Natural Computing, Springer Verlag, 2015, 14 (4), pp.505-506. ⟨10.1007/s11047-015-9524-3⟩
Natural Computing, Springer Verlag, 2015, 14 (4), pp.505-506. ⟨10.1007/s11047-015-9524-3⟩
This special issue contains a selection of papers presented at the ‘‘Third International Workshop on Asynchronous Cellular Automata and Asynchronous Discrete Models’’ (ACA 2014), held as a satellite workshop of the 11th International Conferen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ca825647af2e94fbb634882fe4f306ca
http://hdl.handle.net/10281/164806
http://hdl.handle.net/10281/164806