Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T05:33:10.570Z Has data issue: false hasContentIssue false

Syntax and the single mother

Published online by Cambridge University Press:  28 November 2008

John Anderson
Affiliation:
Department of English Language, University of Edinburgh

Extract

1.Consider a string s = a1 a2 …an over a finite vocabulary Va, such that s is structured by an asymmetric binary relation R: i.e. there are ordered pairs of elements in the string, ai, and aj, where a, R aj.1 S is a simple structured string if (a) there is a unique element ak such that there is no a1 for which it is true that a1 R ak, and if (b) for all am am, ≠ akit is true that there is a unique a1 such that a1 R am. In graph-theoretic terms these conditions define a tree where a1, a2 …a are paired with nodes in the graph and each a, R a is represented by an arc, and where the tree has a unique root or centre associated with a. Figure i is an instance of such a tree, where k = 3. In Figure a, condition (a) is infringed, in that an arc converges on each node; i.e. for all a, there is an aj such that aj R ai. Figure 3, on the other hand, violates condition (b), in that two arcs converge on a2 i.e. there is not a unique ai for whch it is true that a1 R a2.

Information

Type
Articles
Copyright
Copyright © Cambridge University Press 1979

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable