Results 31 to 40 of about 92,734 (332)
RNA-Editing with Combined Insertion and Deletion Preserves Regularity [PDF]
Scientific Annals of Computer Science, 2013 We consider two elementary forms of string rewriting called guided insertion/deletion and guided rewriting. The original strings are modified depending on the match with a given set of auxiliary strings, called guides. Guided insertion/deletion considers
E.P. de Vink, H. Zantema, D. Bošnački
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 +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
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
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
String Diagram Rewrite Theory I: Rewriting with Frobenius Structure [PDF]
Journal of the ACM, 2020 String diagrams are a powerful and intuitive graphical syntax, originating in theoretical physics and later formalised in the context of symmetric monoidal categories. In recent years, they have found application in the modelling of various computational
F. Bonchi +4 more
semanticscholar +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
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
Remakes and Remakers from the Perspective of Translatıon Studies
İstanbul Üniversitesi Çeviribilim Dergisi, 2023 Since the early days of Turkish television, which profoundly affects societal engagement in Turkish culture, television (TV) series garner a sizeable audience and a significant share of total airtime is TV series (“dizi” in Turkish).
Mehmet Erguvan
doaj +1 more source
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