Results 21 to 30 of about 324,410 (283)
Thermodynamic graph-rewriting [PDF]
Logical Methods in Computer Science, 2013 We develop a new thermodynamic approach to stochastic graph-rewriting. The ingredients are a finite set of reversible graph-rewriting rules called generating rules, a finite set of connected graphs P called energy patterns and an energy cost function. The idea is that the generators define the qualitative dynamics, by showing which transformations are ...
Danos, Vincent +3 more
openaire +9 more sources
The Effect of Operating Temperature on the Response Time of Optically Driven Liquid Crystal Displays
Crystals, 2020 Optically driven liquid crystal displays (ODLCDs) realizes their display function by tuning the easy axis of liquid crystal (LC) molecules under polarized blue light, which has been utilized in some optical devices due to its advantages of ultra-low ...
Vladimir Chigrinov +4 more
doaj +1 more source
Confluence of Conditional Term Rewrite Systems via Transformations [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Conditional term rewriting is an intuitive yet complex extension of term rewriting. In order to benefit from the simpler framework of unconditional rewriting, transformations have been defined to eliminate the conditions of conditional term rewrite ...
Karl Gmeiner
doaj +1 more source
A rewriting point of view on strategies [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 This paper is an expository contribution reporting on published work. It focusses on an approach followed in the rewriting community to formalize the concept of strategy.
Hélène Kirchner
doaj +1 more source
Termination of rewrite relations on $\lambda$-terms based on Girard's notion of reducibility [PDF]
, 2015 In this paper, we show how to extend the notion of reducibility introduced by Girard for proving the termination of $\beta$-reduction in the polymorphic $\lambda$-calculus, to prove the termination of various kinds of rewrite relations on $\lambda$-terms,
Blanqui, Frédéric
core +4 more sources
Journal of Algebra, 2011 A group \(G\) is said to have the \(n\)-rewritable property \(Q_n\) if for all elements \(g_1,g_2,\dots,g_n\in G\), there exist two distinct permutations \(\sigma\) and \(\tau\in\text{Sym}_n\) such that \[ g_{\sigma(1)}g_{\sigma(2)}\cdots g_{\sigma(n)}=g_{\tau(1)}g_{\tau(2)}\cdots g_{\tau(n)}. \] For a group \(G\), \(\Delta(G)\) is the set of elements \
Elashiry, M.I., Passman, D.S.
openaire +1 more source
Unfolding of Finite Concurrent Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We consider recognizable trace rewriting systems with level-regular contexts (RTL). A trace language is level-regular if the set of Foata normal forms of its elements is regular. We prove that the rewriting graph of a RTL is word-automatic.
Alexandre Mansard
doaj +1 more source
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems [PDF]
, 2011 We give a method to prove confluence of term rewriting systems that contain non-terminating rewrite rules such as commutativity and associativity.
Aart Middeldorp +10 more
core +4 more sources
Journal of the American Chemical Society, 2009 We describe microarraying of carbohydrates for protein screening using either disulfide bridge or Schiff base imine immobilization chemistries on plasmachemical deposited functional nanolayers. The commonly observed issue of nonspecific background binding of proteins is overcome by spotting carbohydrates through a protein-resistant overlayer yielding ...
Harris, L G +4 more
openaire +3 more sources
Rewriting for Symmetric Monoidal Categories with Commutative (Co)Monoid Structure [PDF]
Logical Methods in Computer ScienceString diagrams are pictorial representations for morphisms of symmetric monoidal categories. They constitute an intuitive and expressive graphical syntax, which has found application in a very diverse range of fields including concurrency theory ...
Aleksandar Milosavljevic +2 more
doaj +1 more source