Results 11 to 20 of about 324,410 (283)
The Criticism and Study of Rewriting Aspects in four Episodes of Bal’ami’s Translation of Tabari’s History [PDF]
The free flaunt of translator’s language and applying rewriting elements is one of the most important reasons for the emergence of authorship translation approach in Persian literature and classic Arabic.
Seyed Esmaeel Hosseini Ajdad Niaki +1 more
doaj +1 more source
Termination of Cycle Rewriting by Transformation and Matrix Interpretation [PDF]
We present techniques to prove termination of cycle rewriting, that is, string rewriting on cycles, which are strings in which the start and end are connected.
David Sabel, Hans Zantema
doaj +1 more source
Two traps currently ensnare Heideggerian scholarship: the “language trap” and the “being trap”. To avoid them, the text argues we should follow Heidegger’s important indication that movement (aka ex-sistential becoming or Zeit) determines all forms of ...
Thomas Sheehan
doaj +1 more source
Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems [PDF]
The tree automaton completion is an algorithm used for proving safety properties of systems that can be modeled by a term rewriting system. This representation and verification technique works well for proving properties of infinite systems like ...
Benoît Boyer, Thomas Genet
doaj +1 more source
Transforming Proof Tableaux of Hoare Logic into Inference Sequences of Rewriting Induction [PDF]
A proof tableau of Hoare logic is an annotated program with pre- and post-conditions, which corresponds to an inference tree of Hoare logic. In this paper, we show that a proof tableau for partial correctness can be transformed into an inference sequence
Shinnosuke Mizutani, Naoki Nishida
doaj +1 more source
Rewrite, rewrite, rewrite, rewrite, rewrite...
The theory of term rewriting systems has important applications in abstract data type specifications and functional programming languages. We begin here a study of properties of systems that are not necessarily terminating, but allow for infinite derivations that have a limit.
N. Dershowitz, S. Kaplan
openaire +2 more sources
Rewrite, rewrite, rewrite, rewrite, rewrite, …
We study properties of rewrite systems that are not necessarily terminating, but allow instead for transfinite derivations that have a limit. In particular, we give conditions for the existence of a limit and for its uniqueness and relate the operational and algebraic semantics of infinitary theories.
Dershowitz, Nachum +2 more
openaire +1 more source
Strategic Port Graph Rewriting: An Interactive Modelling and Analysis Framework [PDF]
We present strategic portgraph rewriting as a basis for the implementation of visual modelling and analysis tools. The goal is to facilitate the specification, analysis and simulation of complex systems, using port graphs.
Fernández, Maribel +2 more
core +12 more sources
RNA-Editing with Combined Insertion and Deletion Preserves Regularity [PDF]
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
Iso-array rewriting P systems with context-free iso-array rules [PDF]
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

