Results 21 to 30 of about 23,943 (237)
The First-Order Theory of Ground Tree Rewrite Graphs [PDF]
Logical Methods in Computer Science, 2014 We prove that the complexity of the uniform first-order theory of ground tree rewrite graphs is in ATIME(2^{2^{poly(n)}},O(n)). Providing a matching lower bound, we show that there is some fixed ground tree rewrite graph whose first-order theory is hard ...
Stefan Göller, Markus Lohrey
doaj +1 more source
Signum: Estudos da Linguagem, 2017 In this article, we analyze the work with the rewriting in higher education, with regard to the operations employed, and the meanings produced from the changes made in the text.
Lidiane de Morais Diógenes Bezerra
doaj +1 more source
On Constructor Rewrite Systems and the Lambda Calculus [PDF]
Logical Methods in Computer Science, 2012 We prove that orthogonal constructor term rewrite systems and lambda-calculus with weak (i.e., no reduction is allowed under the scope of a lambda-abstraction) call-by-value reduction can simulate each other with a linear overhead.
Ugo Dal Lago, Simone Martini
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
A Large Term Rewrite System Modelling a Pioneering Cryptographic Algorithm [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We present a term rewrite system that formally models the Message Authenticator Algorithm (MAA), which was one of the first cryptographic functions for computing a Message Authentication Code and was adopted, between 1987 and 2001, in international ...
Hubert Garavel, Lina Marsso
doaj +1 more source
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
Natural Transformations as Rewrite Rules and Monad Composition [PDF]
Logical Methods in Computer Science, 2019 Eklund et al. (2002) present a graphical technique aimed at simplifying the verification of various category-theoretic constructions, notably the composition of monads. In this note we take a different approach involving string rewriting.
Dexter Kozen
doaj +1 more source
Term Graph Rewriting and Parallel Term Rewriting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 In Proceedings TERMGRAPH 2011, arXiv:1102 ...
CORRADINI, ANDREA, DREWES F.
openaire +4 more sources
Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining [PDF]
Logical Methods in Computer Science, 2014 We investigate unification problems related to the Cipher Block Chaining (CBC) mode of encryption. We first model chaining in terms of a simple, convergent, rewrite system over a signature with two disjoint sorts: list and element.
Siva Anantharaman +3 more
doaj +1 more source
Datatype defining rewrite systems for naturals and integers [PDF]
Logical Methods in Computer Science, 2021 A datatype defining rewrite system (DDRS) is an algebraic (equational) specification intended to specify a datatype. When interpreting the equations from left-to-right, a DDRS defines a term rewriting system that must be ground-complete.
Jan A. Bergstra, Alban Ponse
doaj +1 more source