Abstract | ||
---|---|---|
Further insight into the relation: complexity of general context-sensitivity versus complexity of weak-context-sensitivity, is offered by the following result:The structure of deterministic 3-degrees of context-sensitivity is complex enough to allow an isomorphic embedding of any countable partial ordering. |
Year | DOI | Venue |
---|---|---|
1975 | 10.1007/BF00264568 | Acta Inf. |
Keywords | Field | DocType |
Information System,Operating System,Data Structure,Communication Network,Information Theory | Information theory,Information system,Data structure,Discrete mathematics,Combinatorics,Embedding,Countable set,Telecommunications network,Isomorphism,Partially ordered set,Mathematics | Journal |
Volume | Issue | Citations |
5 | 4 | 0 |
PageRank | References | Authors |
0.34 | 4 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
P. F. Schuler | 1 | 6 | 3.03 |
received september | 2 | 37 | 7.34 |