Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Holger Bock Axelsen"'
Publikováno v:
International Journal of Foundations of Computer Science. 31:1021-1049
It is well known that reversible finite automata do not accept all regular languages, that reversible pushdown automata do not accept all deterministic context-free languages, and that reversible queue automata are less powerful than deterministic re
Publikováno v:
International Journal of Foundations of Computer Science. 28:503-522
Recently, a method to decide the NL-complete problem of whether the language accepted by a given deterministic finite automaton (DFA) can also be accepted by some reversible deterministic finite automaton (REV-DFA) has been derived. Here, we show tha
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 87:33-50
Recently, a number of reversible functional programming languages have been proposed. Common to several of these is the assumption of totality, a property that is not necessarily desirable, and certainly not required in order to guarantee reversibili
Publikováno v:
Theoretical Computer Science. 611:87-115
This paper presents the fundamentals of reversible flowcharts. Reversible flowcharts are intended to naturally represent the structure and control flow of reversible (imperative) programming languages in a simple computation model in the same way cla
Autor:
Tetsuo Yokoyama, Michael Kirkedal Thomsen, Torben Ægidius Mogensen, Eva Rotenberg, Alexis De Vos, Holger Bock Axelsen, Robert Glück, Stéphane Burignat
Publikováno v:
ACM Journal on Emerging Technologies in Computing Systems. 11:1-15
Discrete linear transformations are important tools in information processing. Many such transforms are injective and therefore prime candidates for a physically reversible implementation into hardware. We present here reversible integer cosine trans
Publikováno v:
Reversible Computation ISBN: 9783319405773
RC
RC
It is well known that reversible finite automata do not accept all regular languages and that reversible pushdown automata do not accept all deterministic context-free languages. It is of significant interest both from a practical and theoretical poi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::991ee0622ae2d27035da848d04682d1e
https://doi.org/10.1007/978-3-319-40578-0_6
https://doi.org/10.1007/978-3-319-40578-0_6
Publikováno v:
Implementation and Application of Automata ISBN: 9783319409450
CIAA
CIAA
Recently, Holzer et al. gave a method to decide whether the language accepted by a given deterministic finite automaton (DFA) can also be accepted by some reversible deterministic finite automaton (REV-DFA), and eventually proved NL-completeness. Her
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80469b6e1aae82d785bf914a9bfa1b2e
https://doi.org/10.1007/978-3-319-40946-7_2
https://doi.org/10.1007/978-3-319-40946-7_2
Publikováno v:
Reversible Computation ISBN: 9783319405773
RC
RC
This paper presents initial ideas for the design and implementation of a reversible object-oriented language based on extending Janus with object-oriented concepts such as classes that encapsulate behavior and state, inheritance, virtual dispatching,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::70c332a3c5d9eda7ff259b3612b10f2d
https://doi.org/10.1007/978-3-319-40578-0_10
https://doi.org/10.1007/978-3-319-40578-0_10
Publikováno v:
Language and Automata Theory and Applications ISBN: 9783319299990
LATA
LATA
The deterministic shrinking two-pushdown automata characterize the deterministic growing context-sensitive languages, known to be the Church-Rosser languages. Here, we initiate the investigation of reversible two-pushdown automata, RTPDAs, in particu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e1f98a5d09f094ef77c1db4f90492856
https://doi.org/10.1007/978-3-319-30000-9_44
https://doi.org/10.1007/978-3-319-30000-9_44
Publikováno v:
Logic, Language, Information, and Computation ISBN: 9783662529201
WoLLIC
WoLLIC
We propose a syntactic representation of reversible logic circuits in their entirety, based on Feynman's control interpretation of Toffoli's reversible gate set. A pair of interacting proof calculi for reasoning about these circuits is presented, bas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99512a6ad3be16de7f3b4b8fa792e4c0
https://doi.org/10.1007/978-3-662-52921-8_4
https://doi.org/10.1007/978-3-662-52921-8_4