Abstract
This paper is concerned with letter-rewriting systems in which context-free rewriting productions are equipped with context conditions. Such a production, π = A → α can be used to rewrite an occurrence of A in a string x only if x satisfies the context conditions attached to π. In particular, we are concerned with situations where the context conditions of several productions are satisfied by a given occurrence of A. Deciding which of these productions can be applied to rewrite this occurrence is done by (once a priori) fixed priorities among all context conditions.
Original language | English |
---|---|
Pages (from-to) | 15-50 |
Number of pages | 36 |
Journal | Information Sciences |
Volume | 14 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1978 |
Externally published | Yes |
ASJC Scopus subject areas
- Software
- Control and Systems Engineering
- Theoretical Computer Science
- Computer Science Applications
- Information Systems and Management
- Artificial Intelligence