Home About Upload Latest Additions Statistics Contact
UT Proceedings
UT Student Theses
Dutch Academic Output Dutch Dissertations EU Publications (OpenAIRE)
Printversion
Advanced search

Abstract Grammars Based on Transductions (Revised version)

Share/Save/Bookmark

Asveld, Peter R.J. (1989) Abstract Grammars Based on Transductions (Revised version). [Report]

[img]
Preview
PDF
74Kb
Abstract:We study an abstract grammatical model in which the effect (or application) of a production - determined by a so-called transduction - plays the main part rather than the notion of production itself. Under appropriately chosen assumptions on the underlying family $T$ of transductions, we establish elementary, decidability, and complexity properties of the corresponding family $L(T)$ of languages generated by $T$-grammars. These results are special instances of slightly more general properties of so-called $\Gamma$-controlled $T$-grammars, since regular control does not increase the generating power of $T$-grammars (In a $\Gamma$-controlled $T$-grammar we restrict the iteration of $T$-transductions to those sequences of transductions that belong to a given control language, taken from a family $\Gamma$ of control languages).
Item Type:Report
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/66188
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page