# Maximally Parallel Contextual String Rewriting

@inproceedings{Serbanuta2016MaximallyPC, title={Maximally Parallel Contextual String Rewriting}, author={Traian-Florin Serbanuta and Liviu P. Dinu}, booktitle={WRLA}, year={2016} }

This paper introduces contextual string rewriting as a special kind of parallel string rewriting in which each rule defines a context which is not changed by the application of the rule and can be read (but not modified) by other rules applying concurrently. We study maximal parallel rewriting in this setting and provide a method to encode the computation of a maximally parallel instance for a contextual string rewrite system as a decidable normal form problem for a particular term rewrite…

## References

SHOWING 1-10 OF 18 REFERENCES

On Insertion Grammars with Maximum Parallel Derivation

- Computer ScienceFundam. Informaticae
- 2009

In this paper, insertion grammars are investigated and their capacity to generate words parallelly is explored by introducing parallel derivation (where more than one rule can be applied to the string in parallel) and maximum parallel derivations.

A Truly Concurrent Semantics for the K Framework Based on Graph Transformations

- Computer ScienceICGT
- 2012

The resulting parallel term-rewriting relation is proved sound, complete, and serializable with respect to the jungle rewriting flavor of term-graph rewriting, and, therefore, also to term rewriting.

Contextual Insertions/Deletions and Computability

- Computer ScienceInf. Comput.
- 1996

It is proved that every Turing machine can be simulated by a system based entirely on contextual insertions and deletions and decidability of existence of solutions to equations involving these operations.

Building program optimizers with rewriting strategies

- Computer ScienceICFP '98
- 1998

An extended language in which the side-conditions and contextual rules that arise in realistic optimizer specifications can themselves be expressed as strategy-driven rewrites, and a low-level core language which has a clear semantics, can be implemented straightforwardly and can itself be optimized.

Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report

- Computer ScienceCONCUR
- 1996

This paper surveys the work of many researchers on rewriting logic since it was first introduced in 1990. The main emphasis is on the use of rewriting logic as a semantic framework for concurrency.…

A Parallel Approach to Syllabification

- Computer Science, LinguisticsCICLing
- 2005

A parallel manner of syllabification introducing some parallel extensions of insertion grammars is proposed and used in an application to Romanian language syllabization.

Contextual Grammars and Natural Languages

- LinguisticsHandbook of Formal Languages
- 1997

The systematic investigation of natural languages by means of algebraic, combinatorial and set-theoretic models begun in the 1950s concomitantly in Europe and the U.S.A. seems to have given the start in the development of analytical mathematical models of languages.

Maude: specification and programming in rewriting logic

- Computer ScienceTheor. Comput. Sci.
- 2002

Is human sentence parsing serial or parallel? Evidence from event-related brain potentials.

- LinguisticsBrain research. Cognitive brain research
- 2003