Zobrazeno 1 - 10
of 93
pro vyhledávání: '"Hendrik Jan Hoogeboom"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 3, Issue 2 (2007)
String languages recognizable in (deterministic) log-space are characterized either by two-way (deterministic) multi-head automata, or following Immerman, by first-order logic with (deterministic) transitive closure. Here we elaborate this result, an
Externí odkaz:
https://doaj.org/article/a87ade0e3c9245fb82bfb7ef568d2507
Autor:
Robert Brijder, Hendrik Jan Hoogeboom
Publikováno v:
Handbook of the Tutte Polynomial and Related Topics ISBN: 9780429161612
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3dcbb23a56a4f9cc2f8ee328cfe6e9ce
https://doi.org/10.1201/9780429161612-14
https://doi.org/10.1201/9780429161612-14
Publikováno v:
Fundamenta Informaticae. 175:187-199
For a family of sets we consider elements that belong to the same sets within the family as companions. The global dynamics of a reactions system (as introduced by Ehrenfeucht and Rozenberg) can be represented by a directed graph, called a transition
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::59c64654888106972595c45771abeb16
https://doi.org/10.3233/fi-2020-1953
https://doi.org/10.3233/fi-2020-1953
Publikováno v:
Theoretical Computer Science, 881, 83-96. ELSEVIER
Originally, reaction systems were introduced to describe in a formal way the interactions between biochemical reactions taking place in living cells. They are also investigated as an abstract model of interactive computation. A reaction system is det
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::53a3618f1258114d1e2ea5b192db832d
http://hdl.handle.net/1887/3248545
http://hdl.handle.net/1887/3248545
For a family of sets we consider elements that belong to the same sets within the family as companions. The global dynamics of a reactions system (as introduced by Ehrenfeucht and Rozenberg) can be represented by a directed graph, called a transition
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb562c31ed9eda4a9a65c9bf9792c630
https://doi.org/10.3233/stal200011
https://doi.org/10.3233/stal200011
Publikováno v:
Journal of Membrane Computing, 2(3), 194-206. SPRINGERNATURE
Reaction systems, introduced by Ehrenfeucht and Rozenberg, are a theoretical model of computation based on the two main features of biochemical reactions: facilitation and inhibition, which are captured by the individual reactions of the system. All
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6c34e1725bd380d5aa732201740c38df
http://hdl.handle.net/1887/3589966
http://hdl.handle.net/1887/3589966
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, 701, 109-119
Theoretical Computer Science, 701, 109-119
We consider global dynamics of reaction systems as introduced by Ehrenfeucht and Rozenberg. The dynamics is represented by a directed graph, the so-called transition graph, and two reaction systems are considered equivalent if their corresponding tra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5afb0339b9d7cd3f8ef513318612931a
https://doi.org/10.1016/j.tcs.2017.05.019
https://doi.org/10.1016/j.tcs.2017.05.019
DNA rearrangement is a process often found in biology on both developmental and evolutionary scale. While many models have considered abstract operations involved in the rearrangement, the process itself can be directly modeled through four-regular g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::389bd50d66cacbd0b6385cdf49413584
https://doi.org/10.1016/b978-0-12-814066-6.00003-9
https://doi.org/10.1016/b978-0-12-814066-6.00003-9
Autor:
Boris Aguilar, Olcay Akman, Robert Brijder, Timothy Comar, Carsten Conradi, Carina Curto, Robin Davies, Joanna Ellis-Monaghan, Stefan Forcey, Urmi Ghosh-Dastidar, Josselyn Gonzales, Gabriela Hamerlinck, Hendrik Jan Hoogeboom, Daniel Hrozencik, Andy Jenkins, Nataša Jonoska, John Jungck, Logan Keefe, Debra Knisley, Jeff Knisley, Matthew Macauley, Katherine Morrison, David Murrugarra, Greta Pangborn, Casian Pantea, Manda Riehl, Masahico Saito, Widodo Samyono, William Sands, Brandilyn Stigler, Alan Veliz-Cuba, Emilie Wiesner, Nora Youngs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84348b31a3b57dc7bef539202c13ca43
https://doi.org/10.1016/b978-0-12-814066-6.09996-7
https://doi.org/10.1016/b978-0-12-814066-6.09996-7
Publikováno v:
Theoretical Computer Science, 850, 40-97
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of "invisible" pebbles (as opposed to the usual "visible" ones). The resulting pebble tree automata recognize the regular tree language
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f3e0fad2f193fa2a1f3c5b61765d28d5