Results 21 to 30 of about 333,009 (323)
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
Iso-array rewriting P systems with context-free iso-array rules [PDF]
, 2014 A new computing model called P system is a highly distributed and parallel theoretical model, which is proposed in the area of membrane computing. Ceterchi et al.
Bhuvaneswari, K. +4 more
core +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
Needed Computations Shortcutting Needed Steps [PDF]
, 2015 We define a compilation scheme for a constructor-based, strongly-sequential, graph rewriting system which shortcuts some needed steps. The object code is another constructor-based graph rewriting system. This system is normalizing for the original system
Antoy, Sergio +2 more
core +6 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
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
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
Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids [PDF]
, 2015 This paper studies complete rewriting systems and biautomaticity for three interesting classes of finite-rank homogeneous monoids: Chinese monoids, hypoplactic monoids, and sylvester monoids.
Alan J. Cain +4 more
core +2 more sources
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