Maximally Parallel Contextual String Rewriting
| Autor: | Traian Florin Şerbănuţă, Liviu P. Dinu |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Theoretical computer science
Computer science Computation String (computer science) Context (language use) 0102 computer and information sciences Prefix grammar Term (logic) 01 natural sciences Decidability TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES 010201 computation theory & mathematics Computer Science::Logic in Computer Science Computer Science::Programming Languages Computer Science::Symbolic Computation Rewriting Membrane computing |
| Zdroj: | Rewriting Logic and Its Applications ISBN: 9783319448015 WRLA |
| DOI: | 10.1007/978-3-319-44802-2_9 |
| Popis: | 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 system. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|