Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Shepherdson, John C."'
Autor:
Elgot, Calvin C., Shepherdson, John C.
Publikováno v:
Theoretical Computer Science. 8:325-357
A “scalar” flowchart scheme, i.e. one with a single begin “instruction” is reducible iff its underlying flowgraph is reducible in the sense of Cocke and Allen or Hecht and Ullman. We characterize the class of reducible scalar flowchart scheme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb95d08b04fa73e3b820cc95461418af
https://doi.org/10.1016/0304-3975(79)90016-1
https://doi.org/10.1016/0304-3975(79)90016-1
Autor:
Jones, James P., Shepherdson, John C.
Publikováno v:
Archive for Mathematical Logic; December 1983, Vol. 23 Issue: 1 p61-64, 4p
Autor:
Shepherdson, John C.
Publikováno v:
The Journal of Symbolic Logic, 1987 Mar 01. 52(1), 288-289.
Externí odkaz:
https://www.jstor.org/stable/2273888
Autor:
Shepherdson, John C.
Publikováno v:
Journal of Symbolic Logic; March 1987, Vol. 52 Issue: 1 p288-289, 2p
Autor:
Shepherdson, John C.
Publikováno v:
In Foundations of Deductive Databases and Logic Programming 1988:19-88