Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Michael G. Main"'
Publikováno v:
International Journal of Foundations of Computer Science. 23:1173-1184
Reaction systems are an abstract model of biochemical reactions in the living cell within a framework of finite (though often large) discrete dynamical systems. In this setting, this paper provides an analytical and experimental study of stability. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::121c965fbd9b91bffd57e4dc09cabf21
https://doi.org/10.1142/s0129054112500177
https://doi.org/10.1142/s0129054112500177
Publikováno v:
International Journal of Foundations of Computer Science. 22:1499-1517
Reaction systems are a formal framework for investigating processes carried out by biochemical reactions. This paper is an introduction to reaction systems. It provides basic notions together with the underlying intuition and motivation as well as tw
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c078ec4c1fd3095b388f835f7a24355
https://doi.org/10.1142/s0129054111008842
https://doi.org/10.1142/s0129054111008842
Publikováno v:
International Journal of Foundations of Computer Science. 22:167-178
Reaction systems are a formal model of interactions between biochemical reactions. They consist of sets of reactions, where each reaction is classified by its set of reactants (needed for the reaction to take place), its set of inhibitors (each of wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::79772a889fe60864ae16123055ca9a73
https://doi.org/10.1142/s0129054111007927
https://doi.org/10.1142/s0129054111007927
Publikováno v:
International Journal of Foundations of Computer Science. 21:345-356
Reaction systems are a functional model of interactions between biochemical reactions. They define functions on finite sets (over a common finite domain). In this paper, we investigate combinatorial properties of functions defined by reaction systems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0afc1c9548cf7b71418e32855e428db1
https://doi.org/10.1142/s0129054110007295
https://doi.org/10.1142/s0129054110007295
Autor:
Michael G. Main
Publikováno v:
Theoretical Computer Science. 111:125-143
This paper demonstrates completeness of a termination-rule for iterative programs with strongly fair nondeterminism, even when there are countably infinite options for the nondeterminism. This means that whenever a program is guaranteed to terminate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::214ac35381f50461a83400e725722be0
https://doi.org/10.1016/0304-3975(93)90185-v
https://doi.org/10.1016/0304-3975(93)90185-v
Autor:
Michael G. Main, David L. Black
Publikováno v:
Theoretical Computer Science. 107:305-332
Assertional s-rings are introduced to provide an algebraic setting in which the finite and infinite behavior of nondeterministic programs can be expressed and reasoned about. This includes expressing the fair infinite behavior of nondeterministic ite
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::154a37d75d03a14c1c9b1f205f0ec486
https://doi.org/10.1016/0304-3975(93)90173-q
https://doi.org/10.1016/0304-3975(93)90173-q
Publikováno v:
ITiCSE
We show how to teach and motivate small quantum computer programs as a supplemental topic in a CS2 data structures class. A traditional example such as Shor's factorization [8] could be used, but we focus instead on the area of quantum pseudo-telepat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83b7dc1b6a55ca9ad006526ef25077d3
https://doi.org/10.1145/1822090.1822150
https://doi.org/10.1145/1822090.1822150
Publikováno v:
Software: Practice and Experience. 22:419-437
One of the difficult problems that faces a compiler writer is to devise a grammar that is suitable for both efficient parsing and semantic attribution. This paper describes a system that resolves conflicts in LR(1) parsing by taking advantage of info
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d77dd3d9308d4eafc6751f8147ad169
https://doi.org/10.1002/spe.4380220505
https://doi.org/10.1002/spe.4380220505
Autor:
Jochen Hoffmann, Michael G. Main
Publikováno v:
Theoretical Computer Science. 73(3):279-294
Node-label controlled graph grammars (NLC grammars) are a mechanism to generate sets of graphs (called graph languages). This paper examines the generating power of NLC grammars with a restricted connection relation and some closure properties of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::51df564d5b5cfcb84395863841af967d
Autor:
Grzegorz Rozenberg, Michael G. Main
Publikováno v:
Journal of Computer and System Sciences. 40(2):188-228
We introduce a graph-grammar model based on edge-replacement, where both the rewriting and the embedding mechanisms are controlled by edge labels. The general power of this model is established—it turns out to have the complete power of recursive e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::adb38e35042da8e4d102c0228e7e9adf