The graph structure of a deterministic automaton chosen at random
From MaRDI portal
Publication:5371142
DOI10.1002/rsa.20707zbMath1373.05074arXiv1504.06238OpenAlexW3104831136WikidataQ59486643 ScholiaQ59486643MaRDI QIDQ5371142
Publication date: 24 October 2017
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.06238
Random graphs (graph-theoretic aspects) (05C80) Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Directed graphs (digraphs), tournaments (05C20)
Related Items (3)
The giant component of the directed configuration model revisited ⋮ The diameter of the directed configuration model ⋮ Diameter and stationary distribution of random \(r\)-out digraphs
This page was built for publication: The graph structure of a deterministic automaton chosen at random