Issue
Licensed
Unlicensed
Requires Authentication
Volume 10, Issue 6
Contents
-
Requires Authentication UnlicensedTiteleiLicensedOctober 9, 2009
-
Requires Authentication UnlicensedSojourn times for Markov branching processes and the probabilities of extinction of a modified Galton-Watson processLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn permutations with cycle lengths in a random setLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn some properties of complete by expressibility systems of formulas in the Gödel–Löb provability logicLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn the complexity of computation of rudimentary predicatesLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn the number of rules needed for the automaton grammar to generate a finite languageLicensedOctober 9, 2009
-
Requires Authentication UnlicensedOn the traversal of labyrinths in n-dimensional space by automataLicensedOctober 9, 2009
-
Requires Authentication UnlicensedThe completeness criterion for systems which contain all one-place finite-automaton functionsLicensedOctober 9, 2009
-
Requires Authentication UnlicensedCONTENTS OF VOLUMES 1—10LicensedOctober 9, 2009
