Abstract
The paper deals with the following characteristics of random automaton graphs: the numbers of recurrent and nonrecurrent vertices, the number and dimensions of the components of strong connectivity, and the number of vertices attainable from a given one. Limit theorems are found for the distributions of these characteristics. © 1974 Consultants Bureau.
Cite
CITATION STYLE
APA
Grusho, A. A. (1973). Limit distributions of certain characteristics of random automaton graphs. Mathematical Notes of the Academy of Sciences of the USSR, 14(1), 633–637. https://doi.org/10.1007/BF01095785
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free