Zobrazeno 1 - 10
of 12
pro vyhledávání: '"H. Hosken"'
Autor:
J. R. Büchi, W. H. Hosken
Publikováno v:
The Collected Works of J. Richard Büchi ISBN: 9781461389309
Canonical systems with productions of the form a x,b x → c x and xa → xc are shown to produce only the periodic sets. Thus, these systems are equivalent to finite-state grammars.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25de2161bec8c94e2c551a34dd9c5e1e
https://doi.org/10.1007/978-1-4613-8928-6_21
https://doi.org/10.1007/978-1-4613-8928-6_21
Autor:
J. M.C. Uys, D. A. Slight, B. G. Donnelly, B. Every, J. G.R. Macleod, A. Morris, C. J. Skead, R. M. Harwin, A. K. Forrester, C. D. Quickelberge, J. B. Condy, W. J. Lawson, P. Steyn, A. C. Pooley, M. B. Markus, J. H. Hosken, H. Hosken, W. R. Siegfried, P. L. Britton, P. A. Clancey, Jeanne de V. Little, A. J. Tree, P. H. Crone, C. J. Uys, C. J. Broekhuysen
Publikováno v:
Ostrich. 37:227-240
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d6239a1c796de66df08bfeedfa967a6
https://doi.org/10.1080/00306525.1966.9632726
https://doi.org/10.1080/00306525.1966.9632726
Autor:
W. H. Hosken
Publikováno v:
SIAM Journal on Computing. 4:341-347
We consider the problem of finding the best partition of a binary tree addressing structure where the maximum block size is given and a one-block buffer is available. An algorithm is presented for finding an optimum partition. The algorithm operates
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aeb12b313259d786a3eaa482a2dca9e8
https://doi.org/10.1137/0204029
https://doi.org/10.1137/0204029
Autor:
C. H. Langley, R. K. Brooke, T. B. Oatley, M. E. Hurly, D. W. Kurtz, C. H. Fry, R. A. Earlé, J. H. Hosken, Alistair Robertson, S. A. Halse, R. J. Cassidy, G. R. Nichols, J. A. Scott
Publikováno v:
Ostrich. 54:172-184
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80ad43e994d9b4f6cb309e6164c27d2b
https://doi.org/10.1080/00306525.1983.9634467
https://doi.org/10.1080/00306525.1983.9634467
Autor:
R. A. Earlé, Andrew James Hansen, S. McLean, R. H. Taylor, C. H. Fry, J. H. Hosken, D. Skinner, J. J. Herholdt
Publikováno v:
Ostrich. 57:56-64
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c95df2d377949bea821bdd793f88215
https://doi.org/10.1080/00306525.1986.9633638
https://doi.org/10.1080/00306525.1986.9633638
Autor:
J. R. Büchi, W. H. Hosken
Publikováno v:
Mathematical Systems Theory. 4:81-90
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a90ecf12f55c6d17aa22b68c55a58ee
https://doi.org/10.1007/bf01705888
https://doi.org/10.1007/bf01705888
Autor:
R. K. Schmidt, Gray Ranger, John Martin, Robert Martin, D. M. Comins, C. Jacot-GUILLARMOD, J. H. Hosken, D. R. C. Buchanan, W. J. Lawson, J. M. Winterbottom, R. K. Brooke, P. A. Clancey, T. N. Pocock, Miles B. Markus, A. J. Tree, B. G. Donnelly, W. R. Siegfried, A. Morris, E. Middlemiss, D. Blaker, C. J. Skead, J. M. Huiton, J. M. Hutton, H. J. v. D. Doel
Publikováno v:
Ostrich. 36:135-148
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::67b89293fa3598e5dcd8e151236ddc11
https://doi.org/10.1080/00306525.1965.9633876
https://doi.org/10.1080/00306525.1965.9633876
Autor:
William H. Hosken
Publikováno v:
BIT. 12:115-117
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6684a917236129d46d9305dc29db8ae7
https://doi.org/10.1007/bf01932680
https://doi.org/10.1007/bf01932680
Publikováno v:
SWAT (FOCS)
In this paper we provide a formulation of the synchronized execution of a system of tasks using generalized P and V operations. We explore the properties of such processes and present as a main result a decision procedure for settling the consistency
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::81a833d77d07fb81fefa92c9188deeb0
https://doi.org/10.1109/swat.1972.2
https://doi.org/10.1109/swat.1972.2
Autor:
W. H. Hosken
Publikováno v:
BIT. 13:129-129
Post's Canonical systems in one letter are viewed as operations on natural numbers. It is shown that, in a certain sense, these systems are capable of producing arbitrary recursively enumerable sets. Also, certain special cases are examined.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4bdfcd947522f1d05a70d7a94bdf0188
https://doi.org/10.1007/bf01933534
https://doi.org/10.1007/bf01933534