scientific article; zbMATH DE number 777287

zbMATH Open0826.68079MaRDI QIDQ4840163FDOQ4840163

Authors: Gregor Fritz 

Publication date: 20 July 1995

Title of this publication is not available (Why is that?)

Recommendations

• The graph structure of a deterministic automaton chosen at random
• Distribution of the number of accessible states in a random deterministic automaton
• Asymptotic enumeration of minimal automata
• Random deterministic automata
• On the probability of being synchronizable

zbMATH Keywords

reachabilityfinite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Cited In (4)

• First-Order Model-Checking in Random Graphs and Complex Networks
• Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs
• The graph structure of a deterministic automaton chosen at random
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4840163)