Results 21 to 30 of about 31,656 (296)
Towards 3-Dimensional Rewriting Theory [PDF]
Logical Methods in Computer Science, 2014 String rewriting systems have proved very useful to study monoids. In good cases, they give finite presentations of monoids, allowing computations on those and their manipulation by a computer.
Samuel Mimram
doaj +1 more source
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
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
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
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
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
Triangulation in rewriting [PDF]
, 2012 23rd International Conference on Rewriting Techniques and Applications (RTA'12)
van Oostrom, Vincent, Zantema, Hans
openaire +6 more sources
Rewriting in Free Hypergraph Categories [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We study rewriting for equational theories in the context of symmetric monoidal categories where there is a separable Frobenius monoid on each object. These categories, also called hypergraph categories, are increasingly relevant: Frobenius structures ...
Fabio Zanasi
doaj +1 more source
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 +12 more sources
Permutation Groups Generated by γ-Cycles
Axioms, 2022 A γ-cycle is a cycle of the form (i+1,i+2,…,i+m) in the symmetric group Sn. We study the subgroups of Sn generated by several sets of γ-cycles. Our mathematical development is strongly supported by computational experiments and proofs based on do-it ...
Răzvan Diaconescu
doaj +1 more source