Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Titelei

Titelei (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 http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Discrete Mathematics and Applications de Gruyter

Loading next page...
 
/lp/de-gruyter/titelei-n3VShj6Rhi

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
de Gruyter
Copyright
Copyright © 2009 Walter de Gruyter
ISSN
0924-9265
eISSN
1569-3929
DOI
10.1515/dma.2000.10.6.0
Publisher site
See Article on Publisher Site

Abstract

(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

Journal

Discrete Mathematics and Applicationsde Gruyter

Published: Jan 1, 2000

There are no references for this article.