Zobrazeno 1 - 2
of 2
pro vyhledávání: '"77"'
Autor:
Ronald E. Prather
Publikováno v:
Information and Control. (2):159-171
A structured decomposition theorem for Turing machines is given. The nature of the building blocks and the form of the connections allowed suggest a parallel to the Bohm-Jacopini theorem on structured flowcharts. Thus in a broadest sense, there is ob
Autor:
Jonathan L. Gross
Publikováno v:
Journal of Combinatorial Theory, Series B. (3):227-232
Using Petersen's theorem, that every regular graph of even degree is 2-factorable, it is proved that every connected regular graph of even degree is isomorphic to a Schreier coset graph. The method used is a special application of the permutation vol