Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
(ISSN 0924-9265) Vol. 10, No. 6, pp. 535-650 2000 CONTENTS Sojourn times for Markov branching processes and the probabilities of extinction of a modified Galton-Watson process B. A. Sevastyanov On permutations with cycle lengths in a random set A. L Yakymiv On some properties of complete by expressibility systems of formulas in the Gödel-Lob provability logic M F. Ratsa and A. G. Russu On the complexity of computation of rudimentary predicates S. S. Marchenkov On the number of rules needed for the automaton grammar to generate a finite language N. Yu. Demin On the traversal of labyrinths in -dimensional space by automata A. Z. Nasyrov The completeness criterion for systems which contain all one-place finite-automaton functions V.A.Buevich Contents of volumes 1-10
Discrete Mathematics and Applications – de Gruyter
Published: Jan 1, 2000
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.