Abstract
The plane realizability problem for an abstract signed intersection sequence is solved by a twelve-instruction finite-decision algorithm.
Original language | English (US) |
---|---|
Pages (from-to) | 331-341 |
Number of pages | 11 |
Journal | Journal of Combinatorial Theory |
Volume | 7 |
Issue number | 4 |
DOIs | |
State | Published - Dec 1969 |